./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:10:59,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:59,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:10:59,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:59,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:59,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:59,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:59,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:59,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:59,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:59,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:59,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:59,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:59,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:59,393 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:59,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:59,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:59,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:59,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:10:59,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:59,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:59,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:59,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:59,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:59,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:59,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:59,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:59,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:10:59,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:10:59,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:59,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:59,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:59,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:59,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-11 20:10:59,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:59,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:59,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:59,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:59,640 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:59,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-11 20:11:00,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:11:01,053 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:11:01,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-11 20:11:01,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5d8b07a2b/910f5154cacd4d9aaf58adfa28100dd6/FLAG8b2f6d8b9 [2024-10-11 20:11:01,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5d8b07a2b/910f5154cacd4d9aaf58adfa28100dd6 [2024-10-11 20:11:01,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:11:01,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:11:01,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:11:01,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:11:01,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:11:01,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110696b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01, skipping insertion in model container [2024-10-11 20:11:01,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:11:01,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:11:01,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:11:01,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:11:01,706 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:11:01,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01 WrapperNode [2024-10-11 20:11:01,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:11:01,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:11:01,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:11:01,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:11:01,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,733 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-10-11 20:11:01,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:11:01,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:11:01,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:11:01,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:11:01,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,759 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:11:01,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:11:01,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:11:01,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:11:01,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:11:01,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (1/1) ... [2024-10-11 20:11:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:11:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:01,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:11:01,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:11:01,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:11:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:11:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-11 20:11:01,863 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-11 20:11:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:11:01,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:11:01,863 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-11 20:11:01,864 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-11 20:11:01,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:11:01,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:11:01,929 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:11:01,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:11:02,294 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-11 20:11:02,294 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:11:02,322 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:11:02,323 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:11:02,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:02 BoogieIcfgContainer [2024-10-11 20:11:02,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:11:02,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:11:02,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:11:02,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:11:02,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:11:01" (1/3) ... [2024-10-11 20:11:02,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e032290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:02, skipping insertion in model container [2024-10-11 20:11:02,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:01" (2/3) ... [2024-10-11 20:11:02,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e032290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:02, skipping insertion in model container [2024-10-11 20:11:02,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:02" (3/3) ... [2024-10-11 20:11:02,331 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-11 20:11:02,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:11:02,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-11 20:11:02,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:11:02,403 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6fc0e43b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:11:02,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 20:11:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 73 states have (on average 1.643835616438356) internal successors, (120), 89 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 20:11:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:11:02,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:02,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:02,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 374723516, now seen corresponding path program 1 times [2024-10-11 20:11:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431047196] [2024-10-11 20:11:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431047196] [2024-10-11 20:11:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431047196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174337438] [2024-10-11 20:11:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:02,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:02,678 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.643835616438356) internal successors, (120), 89 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:02,798 INFO L93 Difference]: Finished difference Result 249 states and 363 transitions. [2024-10-11 20:11:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:02,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:11:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:02,811 INFO L225 Difference]: With dead ends: 249 [2024-10-11 20:11:02,812 INFO L226 Difference]: Without dead ends: 142 [2024-10-11 20:11:02,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:02,820 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 82 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:02,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 327 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-11 20:11:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-10-11 20:11:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 121 states have internal predecessors, (163), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2024-10-11 20:11:02,866 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 8 [2024-10-11 20:11:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:02,866 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2024-10-11 20:11:02,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2024-10-11 20:11:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:11:02,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:02,868 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:11:02,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2141003497, now seen corresponding path program 1 times [2024-10-11 20:11:02,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:02,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119662644] [2024-10-11 20:11:02,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:11:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119662644] [2024-10-11 20:11:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119662644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:11:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15209536] [2024-10-11 20:11:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:02,925 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:02,967 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2024-10-11 20:11:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:02,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 20:11:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:02,969 INFO L225 Difference]: With dead ends: 133 [2024-10-11 20:11:02,969 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 20:11:02,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:02,970 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:02,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 20:11:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 20:11:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 120 states have internal predecessors, (161), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-10-11 20:11:02,984 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 14 [2024-10-11 20:11:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:02,986 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-10-11 20:11:02,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-10-11 20:11:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:11:02,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:02,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:02,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:11:02,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:02,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:02,988 INFO L85 PathProgramCache]: Analyzing trace with hash -379187772, now seen corresponding path program 1 times [2024-10-11 20:11:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:02,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787998632] [2024-10-11 20:11:02,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:03,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787998632] [2024-10-11 20:11:03,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787998632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:03,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259029015] [2024-10-11 20:11:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:03,044 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:03,088 INFO L93 Difference]: Finished difference Result 246 states and 328 transitions. [2024-10-11 20:11:03,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:03,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:11:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:03,092 INFO L225 Difference]: With dead ends: 246 [2024-10-11 20:11:03,093 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 20:11:03,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:03,094 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:03,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 199 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 20:11:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-10-11 20:11:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 124 states have internal predecessors, (165), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 180 transitions. [2024-10-11 20:11:03,115 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 180 transitions. Word has length 13 [2024-10-11 20:11:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:03,116 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 180 transitions. [2024-10-11 20:11:03,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2024-10-11 20:11:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:11:03,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:03,117 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:03,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:11:03,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1975226380, now seen corresponding path program 1 times [2024-10-11 20:11:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760244351] [2024-10-11 20:11:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760244351] [2024-10-11 20:11:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760244351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874622672] [2024-10-11 20:11:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:03,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:03,204 INFO L87 Difference]: Start difference. First operand 136 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:03,307 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2024-10-11 20:11:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 20:11:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:03,308 INFO L225 Difference]: With dead ends: 193 [2024-10-11 20:11:03,308 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 20:11:03,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:03,310 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:03,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 378 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 20:11:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2024-10-11 20:11:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 149 states have (on average 1.4563758389261745) internal successors, (217), 160 states have internal predecessors, (217), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2024-10-11 20:11:03,325 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 15 [2024-10-11 20:11:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:03,325 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2024-10-11 20:11:03,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2024-10-11 20:11:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:11:03,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:03,326 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:03,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:11:03,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:03,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1946599024, now seen corresponding path program 1 times [2024-10-11 20:11:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547548658] [2024-10-11 20:11:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547548658] [2024-10-11 20:11:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547548658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483283967] [2024-10-11 20:11:03,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:03,388 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:03,520 INFO L93 Difference]: Finished difference Result 194 states and 257 transitions. [2024-10-11 20:11:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:03,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 20:11:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:03,522 INFO L225 Difference]: With dead ends: 194 [2024-10-11 20:11:03,522 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 20:11:03,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:03,523 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:03,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 373 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 20:11:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2024-10-11 20:11:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.423841059602649) internal successors, (215), 161 states have internal predecessors, (215), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2024-10-11 20:11:03,542 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 15 [2024-10-11 20:11:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:03,543 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2024-10-11 20:11:03,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2024-10-11 20:11:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:11:03,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:03,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:03,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:11:03,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:03,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1130135782, now seen corresponding path program 1 times [2024-10-11 20:11:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177278054] [2024-10-11 20:11:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177278054] [2024-10-11 20:11:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177278054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:03,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796113074] [2024-10-11 20:11:03,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:03,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:03,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:03,603 INFO L87 Difference]: Start difference. First operand 174 states and 230 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:03,695 INFO L93 Difference]: Finished difference Result 327 states and 427 transitions. [2024-10-11 20:11:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:03,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:11:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:03,701 INFO L225 Difference]: With dead ends: 327 [2024-10-11 20:11:03,703 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 20:11:03,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:03,705 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 123 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:03,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 312 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 20:11:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2024-10-11 20:11:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 171 states have internal predecessors, (227), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2024-10-11 20:11:03,722 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 14 [2024-10-11 20:11:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:03,722 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2024-10-11 20:11:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2024-10-11 20:11:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:11:03,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:03,727 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:03,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:11:03,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1431981738, now seen corresponding path program 1 times [2024-10-11 20:11:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665013858] [2024-10-11 20:11:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665013858] [2024-10-11 20:11:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665013858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531999641] [2024-10-11 20:11:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:03,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:03,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:03,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:03,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:11:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:03,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:11:03,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:11:03,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531999641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:03,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:03,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 20:11:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944903067] [2024-10-11 20:11:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:03,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:03,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:03,895 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:03,938 INFO L93 Difference]: Finished difference Result 201 states and 269 transitions. [2024-10-11 20:11:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:11:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:03,939 INFO L225 Difference]: With dead ends: 201 [2024-10-11 20:11:03,941 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 20:11:03,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:11:03,942 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:03,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 20:11:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2024-10-11 20:11:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.4102564102564104) internal successors, (220), 166 states have internal predecessors, (220), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-11 20:11:03,953 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 16 [2024-10-11 20:11:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:03,954 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-11 20:11:03,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-11 20:11:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:11:03,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:03,955 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:03,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:11:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:04,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:04,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2049761853, now seen corresponding path program 1 times [2024-10-11 20:11:04,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:04,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901100146] [2024-10-11 20:11:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:11:04,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:04,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901100146] [2024-10-11 20:11:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901100146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:04,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986796985] [2024-10-11 20:11:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:04,218 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:11:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:04,294 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2024-10-11 20:11:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 20:11:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:04,295 INFO L225 Difference]: With dead ends: 204 [2024-10-11 20:11:04,295 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 20:11:04,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:04,296 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 73 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:04,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 373 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 20:11:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2024-10-11 20:11:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 161 states have (on average 1.391304347826087) internal successors, (224), 170 states have internal predecessors, (224), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2024-10-11 20:11:04,307 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 21 [2024-10-11 20:11:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:04,309 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2024-10-11 20:11:04,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:11:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2024-10-11 20:11:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:11:04,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:04,310 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:11:04,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2021134497, now seen corresponding path program 1 times [2024-10-11 20:11:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:04,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643641288] [2024-10-11 20:11:04,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:11:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643641288] [2024-10-11 20:11:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643641288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:04,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:11:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010796171] [2024-10-11 20:11:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:04,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:04,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:11:04,379 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:11:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:04,455 INFO L93 Difference]: Finished difference Result 200 states and 261 transitions. [2024-10-11 20:11:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:11:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 20:11:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:04,458 INFO L225 Difference]: With dead ends: 200 [2024-10-11 20:11:04,458 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 20:11:04,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:11:04,460 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:04,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 369 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 20:11:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 176. [2024-10-11 20:11:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 163 states have internal predecessors, (216), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2024-10-11 20:11:04,474 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 21 [2024-10-11 20:11:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2024-10-11 20:11:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:11:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2024-10-11 20:11:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:11:04,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:04,476 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:04,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:11:04,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:04,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 456652371, now seen corresponding path program 1 times [2024-10-11 20:11:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:04,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976012808] [2024-10-11 20:11:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:11:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976012808] [2024-10-11 20:11:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976012808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876218622] [2024-10-11 20:11:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:04,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:04,512 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:04,559 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2024-10-11 20:11:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 20:11:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:04,561 INFO L225 Difference]: With dead ends: 196 [2024-10-11 20:11:04,561 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 20:11:04,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:04,562 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:04,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 299 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 20:11:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2024-10-11 20:11:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 147 states have internal predecessors, (195), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2024-10-11 20:11:04,572 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 20 [2024-10-11 20:11:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:04,572 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2024-10-11 20:11:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:11:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2024-10-11 20:11:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:11:04,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:04,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:11:04,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1399767479, now seen corresponding path program 1 times [2024-10-11 20:11:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775853159] [2024-10-11 20:11:04,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 20:11:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:04,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775853159] [2024-10-11 20:11:04,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775853159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358143966] [2024-10-11 20:11:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:04,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:04,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:04,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:04,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:11:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:04,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:11:04,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:11:04,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358143966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-11 20:11:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303095361] [2024-10-11 20:11:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:11:04,813 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:04,863 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2024-10-11 20:11:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:04,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-10-11 20:11:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:04,864 INFO L225 Difference]: With dead ends: 160 [2024-10-11 20:11:04,864 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 20:11:04,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:11:04,865 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:04,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 20:11:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-11 20:11:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 141 states have (on average 1.375886524822695) internal successors, (194), 146 states have internal predecessors, (194), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:11:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2024-10-11 20:11:04,874 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 37 [2024-10-11 20:11:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2024-10-11 20:11:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:11:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2024-10-11 20:11:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 20:11:04,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:04,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:04,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:11:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:05,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:05,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 443119100, now seen corresponding path program 1 times [2024-10-11 20:11:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767621187] [2024-10-11 20:11:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 20:11:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767621187] [2024-10-11 20:11:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767621187] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987556368] [2024-10-11 20:11:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:05,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:05,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:05,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:05,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:11:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 20:11:05,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:05,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987556368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:05,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-11 20:11:05,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915222376] [2024-10-11 20:11:05,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:05,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:11:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:05,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:11:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:11:05,419 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 20:11:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:05,528 INFO L93 Difference]: Finished difference Result 228 states and 297 transitions. [2024-10-11 20:11:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:11:05,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2024-10-11 20:11:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:05,530 INFO L225 Difference]: With dead ends: 228 [2024-10-11 20:11:05,530 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 20:11:05,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:11:05,531 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 15 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:05,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1188 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 20:11:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-11 20:11:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.364864864864865) internal successors, (202), 154 states have internal predecessors, (202), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-11 20:11:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2024-10-11 20:11:05,540 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 38 [2024-10-11 20:11:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2024-10-11 20:11:05,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 20:11:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2024-10-11 20:11:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:11:05,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:05,541 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:05,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:11:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:05,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:05,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1493287875, now seen corresponding path program 1 times [2024-10-11 20:11:05,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:05,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668680483] [2024-10-11 20:11:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:11:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 20:11:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668680483] [2024-10-11 20:11:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668680483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 20:11:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154385912] [2024-10-11 20:11:05,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:05,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:11:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:11:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:11:05,884 INFO L87 Difference]: Start difference. First operand 170 states and 222 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 20:11:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:05,968 INFO L93 Difference]: Finished difference Result 274 states and 354 transitions. [2024-10-11 20:11:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:11:05,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2024-10-11 20:11:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:05,970 INFO L225 Difference]: With dead ends: 274 [2024-10-11 20:11:05,970 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 20:11:05,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:05,970 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 103 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:05,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 801 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 20:11:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2024-10-11 20:11:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 183 states have (on average 1.349726775956284) internal successors, (247), 189 states have internal predecessors, (247), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-10-11 20:11:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 280 transitions. [2024-10-11 20:11:05,979 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 280 transitions. Word has length 45 [2024-10-11 20:11:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:05,979 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 280 transitions. [2024-10-11 20:11:05,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 20:11:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 280 transitions. [2024-10-11 20:11:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 20:11:05,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:05,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:11:05,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2027857939, now seen corresponding path program 1 times [2024-10-11 20:11:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397155849] [2024-10-11 20:11:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 20:11:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397155849] [2024-10-11 20:11:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397155849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:11:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982373540] [2024-10-11 20:11:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:11:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:11:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:11:06,081 INFO L87 Difference]: Start difference. First operand 212 states and 280 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:06,131 INFO L93 Difference]: Finished difference Result 310 states and 405 transitions. [2024-10-11 20:11:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:11:06,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-11 20:11:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:06,133 INFO L225 Difference]: With dead ends: 310 [2024-10-11 20:11:06,133 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 20:11:06,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:11:06,134 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:06,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 705 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 20:11:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2024-10-11 20:11:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 186 states have (on average 1.3440860215053763) internal successors, (250), 192 states have internal predecessors, (250), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-10-11 20:11:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2024-10-11 20:11:06,142 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 42 [2024-10-11 20:11:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2024-10-11 20:11:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2024-10-11 20:11:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:11:06,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:11:06,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1079318013, now seen corresponding path program 1 times [2024-10-11 20:11:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813122703] [2024-10-11 20:11:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 20:11:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:11:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 20:11:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813122703] [2024-10-11 20:11:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813122703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811892958] [2024-10-11 20:11:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:06,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:06,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:11:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 20:11:06,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:06,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:11:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811892958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:11:06,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:11:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 20:11:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614087856] [2024-10-11 20:11:06,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:11:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:11:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:11:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:11:06,455 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:11:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:06,520 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2024-10-11 20:11:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:11:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 45 [2024-10-11 20:11:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:06,522 INFO L225 Difference]: With dead ends: 309 [2024-10-11 20:11:06,522 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 20:11:06,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:11:06,522 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 8 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:06,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1044 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 20:11:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-11 20:11:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 184 states have internal predecessors, (240), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-11 20:11:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 265 transitions. [2024-10-11 20:11:06,531 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 265 transitions. Word has length 45 [2024-10-11 20:11:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:06,531 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 265 transitions. [2024-10-11 20:11:06,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 20:11:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 265 transitions. [2024-10-11 20:11:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:11:06,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:06,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:06,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:11:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:11:06,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:06,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:06,734 INFO L85 PathProgramCache]: Analyzing trace with hash -736963938, now seen corresponding path program 2 times [2024-10-11 20:11:06,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651836836] [2024-10-11 20:11:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:11:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:11:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651836836] [2024-10-11 20:11:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651836836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681370138] [2024-10-11 20:11:06,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:11:06,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:06,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:06,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:06,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:11:06,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:11:06,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:11:06,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:11:06,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:11:07,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681370138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-11 20:11:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697660999] [2024-10-11 20:11:07,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:11:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:11:07,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:07,104 INFO L87 Difference]: Start difference. First operand 204 states and 265 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,163 INFO L93 Difference]: Finished difference Result 204 states and 265 transitions. [2024-10-11 20:11:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:11:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-10-11 20:11:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,165 INFO L225 Difference]: With dead ends: 204 [2024-10-11 20:11:07,165 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 20:11:07,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:07,166 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 344 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 20:11:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-11 20:11:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 179 states have (on average 1.329608938547486) internal successors, (238), 183 states have internal predecessors, (238), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-11 20:11:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 263 transitions. [2024-10-11 20:11:07,181 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 263 transitions. Word has length 46 [2024-10-11 20:11:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 263 transitions. [2024-10-11 20:11:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:11:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 263 transitions. [2024-10-11 20:11:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 20:11:07,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:11:07,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 20:11:07,387 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:07,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:07,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1365813185, now seen corresponding path program 1 times [2024-10-11 20:11:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345923266] [2024-10-11 20:11:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:11:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 20:11:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345923266] [2024-10-11 20:11:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345923266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:11:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435409916] [2024-10-11 20:11:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:07,463 INFO L87 Difference]: Start difference. First operand 203 states and 263 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:11:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,492 INFO L93 Difference]: Finished difference Result 205 states and 265 transitions. [2024-10-11 20:11:07,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:07,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-10-11 20:11:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,493 INFO L225 Difference]: With dead ends: 205 [2024-10-11 20:11:07,493 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 20:11:07,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:07,494 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 21 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 20:11:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-10-11 20:11:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 179 states have (on average 1.3072625698324023) internal successors, (234), 181 states have internal predecessors, (234), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-11 20:11:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 259 transitions. [2024-10-11 20:11:07,502 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 259 transitions. Word has length 65 [2024-10-11 20:11:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,502 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 259 transitions. [2024-10-11 20:11:07,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 20:11:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 259 transitions. [2024-10-11 20:11:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 20:11:07,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,503 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:11:07,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 609464474, now seen corresponding path program 1 times [2024-10-11 20:11:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812233761] [2024-10-11 20:11:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:11:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:11:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:07,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812233761] [2024-10-11 20:11:07,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812233761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401002147] [2024-10-11 20:11:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:07,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:07,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:11:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:07,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 20:11:07,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:11:07,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401002147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 13 [2024-10-11 20:11:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799197877] [2024-10-11 20:11:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:11:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:11:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:11:07,833 INFO L87 Difference]: Start difference. First operand 201 states and 259 transitions. Second operand has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:11:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:07,948 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2024-10-11 20:11:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:11:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2024-10-11 20:11:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:07,949 INFO L225 Difference]: With dead ends: 311 [2024-10-11 20:11:07,949 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 20:11:07,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:11:07,950 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:07,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1034 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 20:11:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 210. [2024-10-11 20:11:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 188 states have internal predecessors, (240), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 20:11:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2024-10-11 20:11:07,961 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 66 [2024-10-11 20:11:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:07,961 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2024-10-11 20:11:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 20:11:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2024-10-11 20:11:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 20:11:07,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:07,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:07,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:11:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:11:08,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1676202150, now seen corresponding path program 1 times [2024-10-11 20:11:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267704798] [2024-10-11 20:11:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 20:11:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 20:11:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 20:11:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 20:11:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267704798] [2024-10-11 20:11:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267704798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:11:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440367004] [2024-10-11 20:11:08,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:08,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:11:08,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:11:08,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:11:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:11:08,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:11:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:11:08,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:11:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440367004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:11:08,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-11 20:11:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238586013] [2024-10-11 20:11:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:08,273 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,308 INFO L93 Difference]: Finished difference Result 400 states and 520 transitions. [2024-10-11 20:11:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2024-10-11 20:11:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,310 INFO L225 Difference]: With dead ends: 400 [2024-10-11 20:11:08,310 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 20:11:08,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:08,310 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 20:11:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2024-10-11 20:11:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.291005291005291) internal successors, (244), 193 states have internal predecessors, (244), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-11 20:11:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2024-10-11 20:11:08,320 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 65 [2024-10-11 20:11:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2024-10-11 20:11:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2024-10-11 20:11:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 20:11:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:11:08,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:11:08,522 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,523 INFO L85 PathProgramCache]: Analyzing trace with hash 616400951, now seen corresponding path program 1 times [2024-10-11 20:11:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127957335] [2024-10-11 20:11:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:11:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 20:11:08,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127957335] [2024-10-11 20:11:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127957335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:08,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:11:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017448881] [2024-10-11 20:11:08,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:11:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:11:08,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:11:08,643 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,762 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2024-10-11 20:11:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:11:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 20:11:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,764 INFO L225 Difference]: With dead ends: 343 [2024-10-11 20:11:08,764 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 20:11:08,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:11:08,764 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 30 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 592 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:11:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 20:11:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 241. [2024-10-11 20:11:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 215 states have internal predecessors, (270), 19 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-11 20:11:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 310 transitions. [2024-10-11 20:11:08,775 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 310 transitions. Word has length 59 [2024-10-11 20:11:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 310 transitions. [2024-10-11 20:11:08,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 310 transitions. [2024-10-11 20:11:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 20:11:08,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,777 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:11:08,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1979203262, now seen corresponding path program 1 times [2024-10-11 20:11:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791932312] [2024-10-11 20:11:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:11:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 20:11:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791932312] [2024-10-11 20:11:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791932312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:11:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422144192] [2024-10-11 20:11:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:11:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:11:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:08,852 INFO L87 Difference]: Start difference. First operand 241 states and 310 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:08,881 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2024-10-11 20:11:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:11:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 20:11:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:08,883 INFO L225 Difference]: With dead ends: 252 [2024-10-11 20:11:08,883 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 20:11:08,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:11:08,883 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:08,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 156 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 20:11:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2024-10-11 20:11:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 217 states have internal predecessors, (270), 20 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-10-11 20:11:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2024-10-11 20:11:08,902 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 60 [2024-10-11 20:11:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2024-10-11 20:11:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 20:11:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2024-10-11 20:11:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:11:08,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:08,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:11:08,903 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:08,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash -443305329, now seen corresponding path program 1 times [2024-10-11 20:11:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208292990] [2024-10-11 20:11:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 20:11:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 20:11:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:11:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:11:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:11:09,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208292990] [2024-10-11 20:11:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208292990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:09,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:11:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916608595] [2024-10-11 20:11:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:09,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:11:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:11:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:11:09,050 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:11:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:09,111 INFO L93 Difference]: Finished difference Result 334 states and 428 transitions. [2024-10-11 20:11:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:11:09,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2024-10-11 20:11:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:09,113 INFO L225 Difference]: With dead ends: 334 [2024-10-11 20:11:09,113 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 20:11:09,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:11:09,113 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:09,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 748 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 20:11:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2024-10-11 20:11:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 223 states have internal predecessors, (274), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2024-10-11 20:11:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2024-10-11 20:11:09,127 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 75 [2024-10-11 20:11:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2024-10-11 20:11:09,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 20:11:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2024-10-11 20:11:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 20:11:09,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:11:09,128 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 20:11:09,129 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-11 20:11:09,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:11:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash 812106054, now seen corresponding path program 1 times [2024-10-11 20:11:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:11:09,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064615690] [2024-10-11 20:11:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:11:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:11:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:11:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:11:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 20:11:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:11:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:11:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 20:11:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:11:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 20:11:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:11:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064615690] [2024-10-11 20:11:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064615690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:11:09,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:11:09,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:11:09,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573099177] [2024-10-11 20:11:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:11:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:11:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:11:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:11:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:09,270 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:11:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:11:09,307 INFO L93 Difference]: Finished difference Result 256 states and 334 transitions. [2024-10-11 20:11:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:11:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2024-10-11 20:11:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:11:09,308 INFO L225 Difference]: With dead ends: 256 [2024-10-11 20:11:09,308 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:11:09,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:11:09,309 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:11:09,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:11:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:11:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:11:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:11:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:11:09,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2024-10-11 20:11:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:11:09,310 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:11:09,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:11:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:11:09,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-11 20:11:09,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-11 20:11:09,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-11 20:11:09,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-11 20:11:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 20:11:09,317 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:11:09,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:11:09,823 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:11:09,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:11:09 BoogieIcfgContainer [2024-10-11 20:11:09,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:11:09,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:11:09,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:11:09,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:11:09,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:02" (3/4) ... [2024-10-11 20:11:09,847 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:11:09,849 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-10-11 20:11:09,851 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2024-10-11 20:11:09,851 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:11:09,856 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2024-10-11 20:11:09,858 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 20:11:09,858 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:11:09,858 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:11:09,879 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-10-11 20:11:09,879 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-11 20:11:09,901 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-11 20:11:09,901 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-10-11 20:11:09,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:11:09,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:11:09,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:11:09,938 INFO L158 Benchmark]: Toolchain (without parser) took 8478.87ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 122.8MB in the beginning and 224.5MB in the end (delta: -101.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.27ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 107.4MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.26ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 106.4MB in the end (delta: 995.4kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: Boogie Preprocessor took 49.64ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: RCFGBuilder took 536.44ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 80.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,939 INFO L158 Benchmark]: TraceAbstraction took 7518.75ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 79.2MB in the beginning and 230.8MB in the end (delta: -151.6MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,940 INFO L158 Benchmark]: Witness Printer took 93.12ms. Allocated memory is still 268.4MB. Free memory was 230.8MB in the beginning and 224.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:11:09,940 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.65ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.27ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 107.4MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.26ms. Allocated memory is still 153.1MB. Free memory was 107.4MB in the beginning and 106.4MB in the end (delta: 995.4kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.64ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 103.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 536.44ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 80.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7518.75ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 79.2MB in the beginning and 230.8MB in the end (delta: -151.6MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. * Witness Printer took 93.12ms. Allocated memory is still 268.4MB. Free memory was 230.8MB in the beginning and 224.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 10516 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8158 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1754 IncrementalHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 2358 mSDtfsCounter, 1754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 553 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=22, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 309 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1239 ConstructedInterpolants, 0 QuantifiedInterpolants, 2167 SizeOfPredicates, 4 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 375/397 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:11:09,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE