./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_1-3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:35:07,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:35:07,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 19:35:07,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:35:07,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:35:07,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:35:07,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:35:07,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:35:07,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:35:07,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:35:07,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:35:07,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:35:07,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:35:07,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:35:07,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:35:07,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:35:07,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:35:07,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:35:07,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:35:07,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:35:07,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:35:07,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:35:07,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:35:07,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:35:07,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:35:07,753 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:35:07,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:35:07,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:35:07,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:35:07,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:35:07,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:35:07,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:35:07,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:35:07,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:35:07,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:07,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:35:07,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:35:07,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:35:07,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:35:07,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:35:07,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:35:07,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:35:07,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:35:07,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:35:07,758 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/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/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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2024-10-24 19:35:08,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:35:08,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:35:08,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:35:08,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:35:08,069 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:35:08,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-10-24 19:35:09,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:35:09,766 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:35:09,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-10-24 19:35:09,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e85b857/0c149f2b47804130ab5c51b90fa4956c/FLAG056e933b8 [2024-10-24 19:35:10,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68e85b857/0c149f2b47804130ab5c51b90fa4956c [2024-10-24 19:35:10,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:35:10,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:35:10,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:10,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:35:10,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:35:10,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64777302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10, skipping insertion in model container [2024-10-24 19:35:10,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:35:10,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:10,415 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:35:10,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:10,501 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:35:10,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10 WrapperNode [2024-10-24 19:35:10,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:10,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:10,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:35:10,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:35:10,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,554 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 209 [2024-10-24 19:35:10,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:10,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:35:10,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:35:10,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:35:10,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,585 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-24 19:35:10,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:35:10,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:35:10,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:35:10,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:35:10,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (1/1) ... [2024-10-24 19:35:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:10,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:35:10,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:35:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:35:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:35:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-24 19:35:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-24 19:35:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:35:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:35:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 19:35:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 19:35:10,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:35:10,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:35:11,398 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-10-24 19:35:11,399 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:35:11,441 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:35:11,441 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:35:11,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:11 BoogieIcfgContainer [2024-10-24 19:35:11,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:35:11,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:35:11,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:35:11,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:35:11,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:35:10" (1/3) ... [2024-10-24 19:35:11,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20725b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:11, skipping insertion in model container [2024-10-24 19:35:11,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:10" (2/3) ... [2024-10-24 19:35:11,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f20725b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:11, skipping insertion in model container [2024-10-24 19:35:11,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:11" (3/3) ... [2024-10-24 19:35:11,455 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2024-10-24 19:35:11,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:35:11,472 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-24 19:35:11,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:35:11,550 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;@1590ddf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:35:11,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-24 19:35:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 122 states have internal predecessors, (167), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 19:35:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 19:35:11,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:11,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:11,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:11,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:11,577 INFO L85 PathProgramCache]: Analyzing trace with hash -527543462, now seen corresponding path program 1 times [2024-10-24 19:35:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:11,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615754852] [2024-10-24 19:35:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:11,841 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-24 19:35:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:11,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615754852] [2024-10-24 19:35:11,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615754852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:11,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:11,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065675335] [2024-10-24 19:35:11,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:11,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:11,891 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.7040816326530612) internal successors, (167), 122 states have internal predecessors, (167), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 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-24 19:35:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:12,094 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2024-10-24 19:35:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:12,097 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-24 19:35:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:12,107 INFO L225 Difference]: With dead ends: 315 [2024-10-24 19:35:12,107 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 19:35:12,111 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-24 19:35:12,114 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 87 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:12,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 463 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 19:35:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-10-24 19:35:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.504201680672269) internal successors, (179), 136 states have internal predecessors, (179), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2024-10-24 19:35:12,163 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 8 [2024-10-24 19:35:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2024-10-24 19:35:12,164 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-24 19:35:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2024-10-24 19:35:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:12,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:12,166 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:35:12,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 837934160, now seen corresponding path program 1 times [2024-10-24 19:35:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659397846] [2024-10-24 19:35:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,255 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-24 19:35:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:12,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659397846] [2024-10-24 19:35:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659397846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:12,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:12,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319003143] [2024-10-24 19:35:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:12,262 INFO L87 Difference]: Start difference. First operand 146 states and 191 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-24 19:35:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:12,320 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2024-10-24 19:35:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:12,321 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-24 19:35:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:12,322 INFO L225 Difference]: With dead ends: 146 [2024-10-24 19:35:12,325 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 19:35:12,325 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-24 19:35:12,327 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:12,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 212 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 19:35:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-24 19:35:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 135 states have internal predecessors, (177), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2024-10-24 19:35:12,354 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 14 [2024-10-24 19:35:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:12,355 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2024-10-24 19:35:12,355 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-24 19:35:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2024-10-24 19:35:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 19:35:12,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:12,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:12,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:35:12,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2025676570, now seen corresponding path program 1 times [2024-10-24 19:35:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505236116] [2024-10-24 19:35:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,447 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-24 19:35:12,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505236116] [2024-10-24 19:35:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505236116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:12,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592921754] [2024-10-24 19:35:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:12,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:12,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:12,452 INFO L87 Difference]: Start difference. First operand 145 states and 189 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-24 19:35:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:12,515 INFO L93 Difference]: Finished difference Result 272 states and 354 transitions. [2024-10-24 19:35:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:12,516 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-24 19:35:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:12,518 INFO L225 Difference]: With dead ends: 272 [2024-10-24 19:35:12,518 INFO L226 Difference]: Without dead ends: 157 [2024-10-24 19:35:12,518 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-24 19:35:12,522 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 215 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-24 19:35:12,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 215 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-24 19:35:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2024-10-24 19:35:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4715447154471544) internal successors, (181), 139 states have internal predecessors, (181), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2024-10-24 19:35:12,546 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 13 [2024-10-24 19:35:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:12,547 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2024-10-24 19:35:12,547 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-24 19:35:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2024-10-24 19:35:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:12,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:12,549 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:12,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:35:12,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:12,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 234782597, now seen corresponding path program 1 times [2024-10-24 19:35:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:12,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175773071] [2024-10-24 19:35:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,665 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-24 19:35:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175773071] [2024-10-24 19:35:12,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175773071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937807384] [2024-10-24 19:35:12,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:12,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:12,670 INFO L87 Difference]: Start difference. First operand 149 states and 193 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-24 19:35:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:12,801 INFO L93 Difference]: Finished difference Result 208 states and 270 transitions. [2024-10-24 19:35:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:12,802 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-24 19:35:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:12,804 INFO L225 Difference]: With dead ends: 208 [2024-10-24 19:35:12,804 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 19:35:12,806 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-24 19:35:12,809 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 141 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:12,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 323 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 19:35:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-10-24 19:35:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 166 states have (on average 1.4578313253012047) internal successors, (242), 181 states have internal predecessors, (242), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 254 transitions. [2024-10-24 19:35:12,825 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 254 transitions. Word has length 15 [2024-10-24 19:35:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:12,825 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 254 transitions. [2024-10-24 19:35:12,825 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-24 19:35:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 254 transitions. [2024-10-24 19:35:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:12,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:12,827 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:35:12,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 206155241, now seen corresponding path program 1 times [2024-10-24 19:35:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874385125] [2024-10-24 19:35:12,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:12,925 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-24 19:35:12,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:12,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874385125] [2024-10-24 19:35:12,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874385125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:12,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:12,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803625674] [2024-10-24 19:35:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:12,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:12,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:12,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:12,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:12,930 INFO L87 Difference]: Start difference. First operand 192 states and 254 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-24 19:35:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:13,050 INFO L93 Difference]: Finished difference Result 213 states and 274 transitions. [2024-10-24 19:35:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:13,051 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-24 19:35:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:13,052 INFO L225 Difference]: With dead ends: 213 [2024-10-24 19:35:13,052 INFO L226 Difference]: Without dead ends: 210 [2024-10-24 19:35:13,053 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-24 19:35:13,056 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 143 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:13,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 321 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-24 19:35:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2024-10-24 19:35:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 181 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 249 transitions. [2024-10-24 19:35:13,076 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 249 transitions. Word has length 15 [2024-10-24 19:35:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:13,076 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 249 transitions. [2024-10-24 19:35:13,077 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-24 19:35:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 249 transitions. [2024-10-24 19:35:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:13,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:13,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:35:13,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:13,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1628590596, now seen corresponding path program 1 times [2024-10-24 19:35:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186542779] [2024-10-24 19:35:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:13,144 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-24 19:35:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186542779] [2024-10-24 19:35:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186542779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994128123] [2024-10-24 19:35:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:13,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:13,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:13,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:13,146 INFO L87 Difference]: Start difference. First operand 192 states and 249 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-24 19:35:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:13,264 INFO L93 Difference]: Finished difference Result 362 states and 463 transitions. [2024-10-24 19:35:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:13,265 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-24 19:35:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:13,269 INFO L225 Difference]: With dead ends: 362 [2024-10-24 19:35:13,269 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 19:35:13,270 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-24 19:35:13,271 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:13,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 405 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 19:35:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 203. [2024-10-24 19:35:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 178 states have (on average 1.404494382022472) internal successors, (250), 192 states have internal predecessors, (250), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 262 transitions. [2024-10-24 19:35:13,293 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 262 transitions. Word has length 14 [2024-10-24 19:35:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:13,295 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 262 transitions. [2024-10-24 19:35:13,295 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-24 19:35:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 262 transitions. [2024-10-24 19:35:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:13,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:13,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:13,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:35:13,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:13,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash -433785564, now seen corresponding path program 1 times [2024-10-24 19:35:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:13,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859475225] [2024-10-24 19:35:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:13,337 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-24 19:35:13,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:13,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859475225] [2024-10-24 19:35:13,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859475225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:13,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816387993] [2024-10-24 19:35:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:13,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:13,353 INFO L87 Difference]: Start difference. First operand 203 states and 262 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-24 19:35:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:13,441 INFO L93 Difference]: Finished difference Result 371 states and 477 transitions. [2024-10-24 19:35:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:13,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2024-10-24 19:35:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:13,444 INFO L225 Difference]: With dead ends: 371 [2024-10-24 19:35:13,447 INFO L226 Difference]: Without dead ends: 212 [2024-10-24 19:35:13,448 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-24 19:35:13,449 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 213 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:13,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 213 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-24 19:35:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2024-10-24 19:35:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.3777777777777778) internal successors, (248), 194 states have internal predecessors, (248), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 260 transitions. [2024-10-24 19:35:13,511 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 260 transitions. Word has length 15 [2024-10-24 19:35:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:13,511 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 260 transitions. [2024-10-24 19:35:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-24 19:35:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2024-10-24 19:35:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:13,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:13,512 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:13,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:35:13,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:13,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 841724660, now seen corresponding path program 1 times [2024-10-24 19:35:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:13,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843060295] [2024-10-24 19:35:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:13,573 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-24 19:35:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843060295] [2024-10-24 19:35:13,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843060295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988394273] [2024-10-24 19:35:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:13,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:13,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 19:35:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:13,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:13,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:13,709 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-24 19:35:13,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988394273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 19:35:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253292029] [2024-10-24 19:35:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:13,713 INFO L87 Difference]: Start difference. First operand 205 states and 260 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-24 19:35:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:13,784 INFO L93 Difference]: Finished difference Result 222 states and 284 transitions. [2024-10-24 19:35:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:13,784 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-24 19:35:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:13,787 INFO L225 Difference]: With dead ends: 222 [2024-10-24 19:35:13,787 INFO L226 Difference]: Without dead ends: 221 [2024-10-24 19:35:13,788 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-24 19:35:13,789 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:13,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 311 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-24 19:35:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2024-10-24 19:35:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3806818181818181) internal successors, (243), 190 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2024-10-24 19:35:13,803 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 16 [2024-10-24 19:35:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:13,803 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2024-10-24 19:35:13,804 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-24 19:35:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2024-10-24 19:35:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:13,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:13,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:13,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:35:14,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:14,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:14,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1088995921, now seen corresponding path program 1 times [2024-10-24 19:35:14,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615990627] [2024-10-24 19:35:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,070 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-24 19:35:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615990627] [2024-10-24 19:35:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615990627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376831700] [2024-10-24 19:35:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:14,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:14,072 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-24 19:35:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:14,125 INFO L93 Difference]: Finished difference Result 346 states and 438 transitions. [2024-10-24 19:35:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-24 19:35:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:14,127 INFO L225 Difference]: With dead ends: 346 [2024-10-24 19:35:14,127 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 19:35:14,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-24 19:35:14,128 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:14,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 327 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 19:35:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-10-24 19:35:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 138 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2024-10-24 19:35:14,135 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 16 [2024-10-24 19:35:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:14,136 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2024-10-24 19:35:14,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-24 19:35:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2024-10-24 19:35:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:14,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,137 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:35:14,137 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:14,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1246834637, now seen corresponding path program 1 times [2024-10-24 19:35:14,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776131411] [2024-10-24 19:35:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,210 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-24 19:35:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:14,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776131411] [2024-10-24 19:35:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776131411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:14,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:14,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:14,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625887340] [2024-10-24 19:35:14,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:14,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:14,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:14,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:14,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:14,213 INFO L87 Difference]: Start difference. First operand 149 states and 187 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-24 19:35:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:14,353 INFO L93 Difference]: Finished difference Result 163 states and 200 transitions. [2024-10-24 19:35:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:14,354 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-24 19:35:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:14,355 INFO L225 Difference]: With dead ends: 163 [2024-10-24 19:35:14,355 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 19:35:14,356 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-24 19:35:14,356 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 132 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:14,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 377 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 19:35:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2024-10-24 19:35:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.3875968992248062) internal successors, (179), 142 states have internal predecessors, (179), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2024-10-24 19:35:14,366 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 21 [2024-10-24 19:35:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:14,366 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2024-10-24 19:35:14,366 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-24 19:35:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2024-10-24 19:35:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:14,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,367 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:35:14,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:14,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1218207281, now seen corresponding path program 1 times [2024-10-24 19:35:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750584764] [2024-10-24 19:35:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,435 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-24 19:35:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750584764] [2024-10-24 19:35:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750584764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:14,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:14,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001594729] [2024-10-24 19:35:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:14,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:14,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:14,438 INFO L87 Difference]: Start difference. First operand 153 states and 191 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-24 19:35:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:14,549 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2024-10-24 19:35:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:14,550 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-24 19:35:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:14,552 INFO L225 Difference]: With dead ends: 162 [2024-10-24 19:35:14,552 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 19:35:14,552 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-24 19:35:14,553 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 136 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:14,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 382 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 19:35:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2024-10-24 19:35:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 135 states have internal predecessors, (171), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2024-10-24 19:35:14,564 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 21 [2024-10-24 19:35:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:14,564 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2024-10-24 19:35:14,565 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-24 19:35:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2024-10-24 19:35:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 19:35:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,565 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-24 19:35:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 19:35:14,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:14,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash 15518330, now seen corresponding path program 1 times [2024-10-24 19:35:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436109005] [2024-10-24 19:35:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,612 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-24 19:35:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436109005] [2024-10-24 19:35:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436109005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:14,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222348508] [2024-10-24 19:35:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:14,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:14,614 INFO L87 Difference]: Start difference. First operand 146 states and 183 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-24 19:35:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:14,668 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2024-10-24 19:35:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:14,669 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-24 19:35:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:14,670 INFO L225 Difference]: With dead ends: 150 [2024-10-24 19:35:14,670 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 19:35:14,671 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-24 19:35:14,671 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:14,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 299 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 19:35:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2024-10-24 19:35:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 123 states have internal predecessors, (157), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2024-10-24 19:35:14,682 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 20 [2024-10-24 19:35:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2024-10-24 19:35:14,683 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-24 19:35:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2024-10-24 19:35:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 19:35:14,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,683 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 19:35:14,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:14,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1409742151, now seen corresponding path program 1 times [2024-10-24 19:35:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918307916] [2024-10-24 19:35:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:35:14,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:35:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:35:14,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:35:14,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:35:14,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-24 19:35:14,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-24 19:35:14,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-24 19:35:14,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-24 19:35:14,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-24 19:35:14,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-24 19:35:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:35:14,732 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,762 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:35:14,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:35:14 BoogieIcfgContainer [2024-10-24 19:35:14,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:35:14,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:35:14,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:35:14,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:35:14,769 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:11" (3/4) ... [2024-10-24 19:35:14,771 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 19:35:14,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:35:14,773 INFO L158 Benchmark]: Toolchain (without parser) took 4660.81ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 116.4MB in the beginning and 58.3MB in the end (delta: 58.1MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,773 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:35:14,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.29ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 99.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 97.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,774 INFO L158 Benchmark]: Boogie Preprocessor took 45.23ms. Allocated memory is still 172.0MB. Free memory was 97.0MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,775 INFO L158 Benchmark]: RCFGBuilder took 841.15ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 94.4MB in the beginning and 174.1MB in the end (delta: -79.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,775 INFO L158 Benchmark]: TraceAbstraction took 3323.25ms. Allocated memory is still 207.6MB. Free memory was 174.1MB in the beginning and 59.4MB in the end (delta: 114.7MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,775 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 207.6MB. Free memory was 59.4MB in the beginning and 58.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:14,777 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.13ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.29ms. Allocated memory is still 172.0MB. Free memory was 116.4MB in the beginning and 99.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 172.0MB. Free memory was 99.6MB in the beginning and 97.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.23ms. Allocated memory is still 172.0MB. Free memory was 97.0MB in the beginning and 94.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 841.15ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 94.4MB in the beginning and 174.1MB in the end (delta: -79.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3323.25ms. Allocated memory is still 207.6MB. Free memory was 174.1MB in the beginning and 59.4MB in the end (delta: 114.7MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 207.6MB. Free memory was 59.4MB in the beginning and 58.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=0, eb=0] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L251] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 821 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 799 mSDsluCounter, 3848 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2463 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1385 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 127 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 26/28 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 19:35:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:35:17,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:35:17,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-24 19:35:17,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:35:17,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:35:17,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:35:17,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:35:17,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:35:17,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:35:17,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:35:17,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:35:17,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:35:17,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:35:17,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:35:17,302 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:35:17,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:35:17,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:35:17,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:35:17,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:35:17,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:35:17,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:35:17,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:35:17,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:35:17,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:35:17,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 19:35:17,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:35:17,311 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:35:17,311 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 19:35:17,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:35:17,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:35:17,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:35:17,312 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:35:17,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:35:17,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:35:17,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:35:17,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:35:17,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:17,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:35:17,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:35:17,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:35:17,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 19:35:17,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 19:35:17,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:35:17,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:35:17,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:35:17,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:35:17,317 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 19:35:17,317 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/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/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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2024-10-24 19:35:17,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:35:17,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:35:17,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:35:17,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:35:17,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:35:17,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-10-24 19:35:19,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:35:19,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:35:19,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-10-24 19:35:19,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e9271ae/7a0deace5ee144dbb60dcd16a2e0b9d7/FLAG2bae6e547 [2024-10-24 19:35:19,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e9271ae/7a0deace5ee144dbb60dcd16a2e0b9d7 [2024-10-24 19:35:19,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:35:19,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:35:19,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:19,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:35:19,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:35:19,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:19,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755f0e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19, skipping insertion in model container [2024-10-24 19:35:19,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:19,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:35:19,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:19,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:35:19,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:19,999 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:35:20,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19 WrapperNode [2024-10-24 19:35:20,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:20,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:20,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:35:20,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:35:20,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,058 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2024-10-24 19:35:20,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:20,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:35:20,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:35:20,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:35:20,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,104 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-24 19:35:20,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:35:20,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:35:20,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:35:20,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:35:20,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (1/1) ... [2024-10-24 19:35:20,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:20,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:20,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:35:20,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:35:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:35:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 19:35:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-24 19:35:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-24 19:35:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:35:20,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:35:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 19:35:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 19:35:20,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:35:20,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:35:20,818 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-10-24 19:35:20,819 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:35:20,856 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:35:20,856 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:35:20,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:20 BoogieIcfgContainer [2024-10-24 19:35:20,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:35:20,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:35:20,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:35:20,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:35:20,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:35:19" (1/3) ... [2024-10-24 19:35:20,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158cb12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:20, skipping insertion in model container [2024-10-24 19:35:20,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:19" (2/3) ... [2024-10-24 19:35:20,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158cb12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:20, skipping insertion in model container [2024-10-24 19:35:20,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:20" (3/3) ... [2024-10-24 19:35:20,869 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2024-10-24 19:35:20,886 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:35:20,888 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-24 19:35:20,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:35:20,971 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;@51c8d337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:35:20,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-24 19:35:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 98 states have internal predecessors, (130), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 19:35:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 19:35:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:20,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:20,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:20,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 200666572, now seen corresponding path program 1 times [2024-10-24 19:35:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:21,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361404554] [2024-10-24 19:35:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:21,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:21,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 19:35:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 19:35:21,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:21,107 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-24 19:35:21,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:21,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:35:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361404554] [2024-10-24 19:35:21,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361404554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:21,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489825689] [2024-10-24 19:35:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 19:35:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:35:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 19:35:21,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 19:35:21,146 INFO L87 Difference]: Start difference. First operand has 108 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 98 states have internal predecessors, (130), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-24 19:35:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:21,195 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-24 19:35:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 19:35:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-24 19:35:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:21,207 INFO L225 Difference]: With dead ends: 205 [2024-10-24 19:35:21,207 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 19:35:21,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 19:35:21,233 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:21,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 19:35:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 19:35:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 66 states have internal predecessors, (78), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-10-24 19:35:21,282 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 8 [2024-10-24 19:35:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-10-24 19:35:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-24 19:35:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2024-10-24 19:35:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 19:35:21,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:21,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:21,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:21,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 199725306, now seen corresponding path program 1 times [2024-10-24 19:35:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203308019] [2024-10-24 19:35:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:21,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:21,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:21,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 19:35:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:21,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:21,590 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-24 19:35:21,590 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:21,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:35:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203308019] [2024-10-24 19:35:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203308019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946650544] [2024-10-24 19:35:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:35:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:21,594 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-24 19:35:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:21,676 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-10-24 19:35:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-24 19:35:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:21,681 INFO L225 Difference]: With dead ends: 152 [2024-10-24 19:35:21,681 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 19:35:21,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-24 19:35:21,683 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:21,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 242 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 19:35:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 19:35:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 69 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-10-24 19:35:21,699 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 8 [2024-10-24 19:35:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:21,699 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-10-24 19:35:21,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-24 19:35:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-10-24 19:35:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:21,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:21,701 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:21,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:21,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 283910070, now seen corresponding path program 1 times [2024-10-24 19:35:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340536224] [2024-10-24 19:35:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:21,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:21,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:21,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 19:35:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:35:21,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:21,969 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-24 19:35:21,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:21,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:35:21,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340536224] [2024-10-24 19:35:21,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340536224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172771922] [2024-10-24 19:35:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:21,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:35:21,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:21,972 INFO L87 Difference]: Start difference. First operand 79 states and 93 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-24 19:35:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,041 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2024-10-24 19:35:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:22,043 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-24 19:35:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,045 INFO L225 Difference]: With dead ends: 79 [2024-10-24 19:35:22,045 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 19:35:22,046 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-24 19:35:22,047 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:22,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 19:35:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 19:35:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 68 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-10-24 19:35:22,057 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 14 [2024-10-24 19:35:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,058 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-10-24 19:35:22,058 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-24 19:35:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-10-24 19:35:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:22,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,059 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 19:35:22,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:22,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:22,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1152879778, now seen corresponding path program 1 times [2024-10-24 19:35:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:22,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172989422] [2024-10-24 19:35:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:22,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:22,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:22,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 19:35:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 19:35:22,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:22,319 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-24 19:35:22,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:22,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:35:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172989422] [2024-10-24 19:35:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172989422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659282975] [2024-10-24 19:35:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:35:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:22,322 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-24 19:35:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,386 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2024-10-24 19:35:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2024-10-24 19:35:22,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,394 INFO L225 Difference]: With dead ends: 78 [2024-10-24 19:35:22,396 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 19:35:22,397 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-24 19:35:22,397 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 19:35:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-24 19:35:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 67 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2024-10-24 19:35:22,413 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 16 [2024-10-24 19:35:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,414 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2024-10-24 19:35:22,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-24 19:35:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2024-10-24 19:35:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:22,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,415 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:22,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1152812252, now seen corresponding path program 1 times [2024-10-24 19:35:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563835046] [2024-10-24 19:35:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:22,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:22,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 19:35:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:22,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:22,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:22,796 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-24 19:35:22,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:22,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 19:35:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563835046] [2024-10-24 19:35:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563835046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453125346] [2024-10-24 19:35:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 19:35:22,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:22,801 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-24 19:35:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:23,014 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2024-10-24 19:35:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:23,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2024-10-24 19:35:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:23,021 INFO L225 Difference]: With dead ends: 97 [2024-10-24 19:35:23,021 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 19:35:23,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-24 19:35:23,026 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:23,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 180 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 19:35:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 19:35:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-10-24 19:35:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.359375) internal successors, (87), 74 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 19:35:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-10-24 19:35:23,046 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 16 [2024-10-24 19:35:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:23,046 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-10-24 19:35:23,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-24 19:35:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-10-24 19:35:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 19:35:23,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:23,048 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:23,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 19:35:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:23,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-10-24 19:35:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -871198171, now seen corresponding path program 1 times [2024-10-24 19:35:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 19:35:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277207915] [2024-10-24 19:35:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 19:35:23,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 19:35:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 19:35:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:35:23,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:35:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:35:23,423 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 19:35:23,423 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:35:23,425 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-10-24 19:35:23,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-10-24 19:35:23,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-10-24 19:35:23,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-10-24 19:35:23,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-10-24 19:35:23,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-10-24 19:35:23,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-10-24 19:35:23,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-10-24 19:35:23,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-10-24 19:35:23,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-10-24 19:35:23,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-10-24 19:35:23,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-10-24 19:35:23,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:23,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 19:35:23,639 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 19:35:23,668 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:35:23,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:35:23 BoogieIcfgContainer [2024-10-24 19:35:23,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:35:23,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:35:23,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:35:23,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:35:23,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:20" (3/4) ... [2024-10-24 19:35:23,676 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 19:35:23,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:35:23,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:35:23,730 INFO L158 Benchmark]: Toolchain (without parser) took 4159.15ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 39.2MB in the beginning and 45.5MB in the end (delta: -6.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,730 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 39.8MB. Free memory was 18.9MB in the beginning and 18.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:35:23,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.85ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.9MB in the beginning and 52.5MB in the end (delta: -13.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.82ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 50.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,731 INFO L158 Benchmark]: Boogie Preprocessor took 75.09ms. Allocated memory is still 75.5MB. Free memory was 50.5MB in the beginning and 48.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,731 INFO L158 Benchmark]: RCFGBuilder took 719.04ms. Allocated memory is still 75.5MB. Free memory was 48.0MB in the beginning and 46.4MB in the end (delta: 1.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,732 INFO L158 Benchmark]: TraceAbstraction took 2812.37ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 47.6MB in the end (delta: -2.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,732 INFO L158 Benchmark]: Witness Printer took 56.28ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:35:23,735 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.14ms. Allocated memory is still 39.8MB. Free memory was 18.9MB in the beginning and 18.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.85ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 38.9MB in the beginning and 52.5MB in the end (delta: -13.7MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.82ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 50.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.09ms. Allocated memory is still 75.5MB. Free memory was 50.5MB in the beginning and 48.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 719.04ms. Allocated memory is still 75.5MB. Free memory was 48.0MB in the beginning and 46.4MB in the end (delta: 1.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2812.37ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 47.6MB in the end (delta: -2.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 56.28ms. Allocated memory is still 75.5MB. Free memory was 47.6MB in the beginning and 45.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 108 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 857 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 405 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 452 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 57 ConstructedInterpolants, 8 QuantifiedInterpolants, 102 SizeOfPredicates, 2 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-24 19:35:23,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)