./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/bitvector/soft_float_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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:07:07,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:07:07,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:07:07,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:07:07,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:07:07,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:07:07,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:07:07,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:07:07,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:07:07,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:07:07,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:07:07,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:07:07,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:07:07,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:07:07,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:07:07,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:07:07,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:07:07,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:07:07,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:07:07,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:07:07,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:07:07,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:07:07,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:07:07,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:07:07,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:07:07,695 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:07:07,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:07:07,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:07:07,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:07:07,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:07:07,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:07:07,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:07:07,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:07:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:07:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:07,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:07:07,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:07:07,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:07:07,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:07:07,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:07:07,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:07:07,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:07:07,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:07:07,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:07:07,701 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2024-11-09 11:07:07,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:07:07,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:07:07,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:07:07,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:07:07,990 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:07:07,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2024-11-09 11:07:09,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:07:09,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:07:09,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2024-11-09 11:07:09,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0658b460/39f10c6909b948b9b194c0c3390759b6/FLAG3412a37ef [2024-11-09 11:07:10,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0658b460/39f10c6909b948b9b194c0c3390759b6 [2024-11-09 11:07:10,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:07:10,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:07:10,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:10,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:07:10,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:07:10,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b90f6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10, skipping insertion in model container [2024-11-09 11:07:10,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:07:10,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:10,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:07:10,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:07:10,373 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:07:10,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10 WrapperNode [2024-11-09 11:07:10,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:07:10,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:10,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:07:10,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:07:10,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,447 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-11-09 11:07:10,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:07:10,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:07:10,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:07:10,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:07:10,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,499 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-11-09 11:07:10,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:07:10,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:07:10,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:07:10,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:07:10,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (1/1) ... [2024-11-09 11:07:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:07:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:10,573 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-11-09 11:07:10,576 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-11-09 11:07:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:07:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:07:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 11:07:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 11:07:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:07:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:07:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:07:10,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:07:10,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:07:10,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:07:11,161 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-09 11:07:11,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:07:11,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:07:11,180 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:07:11,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:11 BoogieIcfgContainer [2024-11-09 11:07:11,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:07:11,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:07:11,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:07:11,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:07:11,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:07:10" (1/3) ... [2024-11-09 11:07:11,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24db224d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:11, skipping insertion in model container [2024-11-09 11:07:11,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:07:10" (2/3) ... [2024-11-09 11:07:11,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24db224d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:07:11, skipping insertion in model container [2024-11-09 11:07:11,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:07:11" (3/3) ... [2024-11-09 11:07:11,194 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2024-11-09 11:07:11,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:07:11,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-09 11:07:11,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:07:11,301 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;@44bd9346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:07:11,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-09 11:07:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 115 states have internal predecessors, (149), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:07:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:07:11,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:11,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 414699630, now seen corresponding path program 1 times [2024-11-09 11:07:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491381279] [2024-11-09 11:07:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491381279] [2024-11-09 11:07:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491381279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795021737] [2024-11-09 11:07:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:11,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:11,642 INFO L87 Difference]: Start difference. First operand has 122 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 115 states have internal predecessors, (149), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-09 11:07:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:11,806 INFO L93 Difference]: Finished difference Result 295 states and 409 transitions. [2024-11-09 11:07:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-09 11:07:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:11,817 INFO L225 Difference]: With dead ends: 295 [2024-11-09 11:07:11,818 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 11:07:11,821 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-11-09 11:07:11,824 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 90 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:11,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 390 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 11:07:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2024-11-09 11:07:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 134 states have internal predecessors, (172), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 180 transitions. [2024-11-09 11:07:11,879 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 180 transitions. Word has length 9 [2024-11-09 11:07:11,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:11,880 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 180 transitions. [2024-11-09 11:07:11,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-09 11:07:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2024-11-09 11:07:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:11,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:11,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:07:11,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1889546322, now seen corresponding path program 1 times [2024-11-09 11:07:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910899558] [2024-11-09 11:07:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910899558] [2024-11-09 11:07:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910899558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749049248] [2024-11-09 11:07:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:11,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:11,961 INFO L87 Difference]: Start difference. First operand 141 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-11-09 11:07:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:12,030 INFO L93 Difference]: Finished difference Result 293 states and 381 transitions. [2024-11-09 11:07:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-11-09 11:07:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:12,032 INFO L225 Difference]: With dead ends: 293 [2024-11-09 11:07:12,033 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 11:07:12,037 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-11-09 11:07:12,038 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:12,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 201 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 11:07:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2024-11-09 11:07:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 138 states have internal predecessors, (176), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2024-11-09 11:07:12,069 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 14 [2024-11-09 11:07:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:12,070 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2024-11-09 11:07:12,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-11-09 11:07:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2024-11-09 11:07:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 11:07:12,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:12,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:07:12,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:12,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1889434976, now seen corresponding path program 1 times [2024-11-09 11:07:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442778529] [2024-11-09 11:07:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:07:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442778529] [2024-11-09 11:07:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442778529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828444820] [2024-11-09 11:07:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:12,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:12,140 INFO L87 Difference]: Start difference. First operand 145 states and 184 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, (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-11-09 11:07:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:12,208 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2024-11-09 11:07:12,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:12,209 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, (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-11-09 11:07:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:12,212 INFO L225 Difference]: With dead ends: 145 [2024-11-09 11:07:12,212 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 11:07:12,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:07:12,214 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:12,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 11:07:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 11:07:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 137 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2024-11-09 11:07:12,230 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 14 [2024-11-09 11:07:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2024-11-09 11:07:12,231 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, (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-11-09 11:07:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2024-11-09 11:07:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:12,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:12,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:12,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:07:12,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:12,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1122637532, now seen corresponding path program 1 times [2024-11-09 11:07:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362486847] [2024-11-09 11:07:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:12,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:12,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362486847] [2024-11-09 11:07:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362486847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:12,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782165240] [2024-11-09 11:07:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:12,311 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-11-09 11:07:12,312 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-11-09 11:07:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:12,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:12,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782165240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010661284] [2024-11-09 11:07:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:12,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:12,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:12,455 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-09 11:07:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:12,533 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2024-11-09 11:07:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:12,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-09 11:07:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:12,535 INFO L225 Difference]: With dead ends: 170 [2024-11-09 11:07:12,535 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 11:07:12,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:12,541 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:12,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 196 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 11:07:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2024-11-09 11:07:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.4365079365079365) internal successors, (181), 144 states have internal predecessors, (181), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 189 transitions. [2024-11-09 11:07:12,562 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 189 transitions. Word has length 15 [2024-11-09 11:07:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:12,563 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 189 transitions. [2024-11-09 11:07:12,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11-09 11:07:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 189 transitions. [2024-11-09 11:07:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:07:12,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:12,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:12,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:12,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1557057831, now seen corresponding path program 1 times [2024-11-09 11:07:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254096556] [2024-11-09 11:07:12,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254096556] [2024-11-09 11:07:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254096556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197806879] [2024-11-09 11:07:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:12,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:12,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:12,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:12,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:07:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:12,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:12,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:12,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197806879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 11:07:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971110670] [2024-11-09 11:07:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:12,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:12,941 INFO L87 Difference]: Start difference. First operand 151 states and 189 transitions. Second operand has 3 states, 2 states have (on average 7.0) 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-11-09 11:07:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:12,996 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2024-11-09 11:07:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) 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-11-09 11:07:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:12,997 INFO L225 Difference]: With dead ends: 157 [2024-11-09 11:07:12,998 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 11:07:12,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-09 11:07:13,000 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 17 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 11:07:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2024-11-09 11:07:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.4296875) internal successors, (183), 146 states have internal predecessors, (183), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2024-11-09 11:07:13,018 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 15 [2024-11-09 11:07:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2024-11-09 11:07:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) 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-11-09 11:07:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2024-11-09 11:07:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:07:13,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:07:13,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:13,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 442025217, now seen corresponding path program 1 times [2024-11-09 11:07:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:13,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276189884] [2024-11-09 11:07:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:07:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276189884] [2024-11-09 11:07:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276189884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:07:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706695007] [2024-11-09 11:07:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:13,259 INFO L87 Difference]: Start difference. First operand 153 states and 191 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-11-09 11:07:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,299 INFO L93 Difference]: Finished difference Result 153 states and 191 transitions. [2024-11-09 11:07:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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 16 [2024-11-09 11:07:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,302 INFO L225 Difference]: With dead ends: 153 [2024-11-09 11:07:13,302 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 11:07:13,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-09 11:07:13,303 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 11:07:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-11-09 11:07:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 143 states have internal predecessors, (179), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 187 transitions. [2024-11-09 11:07:13,321 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 187 transitions. Word has length 16 [2024-11-09 11:07:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,321 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 187 transitions. [2024-11-09 11:07:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-11-09 11:07:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 187 transitions. [2024-11-09 11:07:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:07:13,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:07:13,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:13,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash -295937648, now seen corresponding path program 1 times [2024-11-09 11:07:13,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:13,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447347204] [2024-11-09 11:07:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447347204] [2024-11-09 11:07:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447347204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41420150] [2024-11-09 11:07:13,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:07:13,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:07:13,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:07:13,378 INFO L87 Difference]: Start difference. First operand 150 states and 187 transitions. Second operand has 3 states, 3 states have (on average 5.0) 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-11-09 11:07:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,432 INFO L93 Difference]: Finished difference Result 307 states and 388 transitions. [2024-11-09 11:07:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:07:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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-11-09 11:07:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,435 INFO L225 Difference]: With dead ends: 307 [2024-11-09 11:07:13,435 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 11:07:13,436 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-11-09 11:07:13,437 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 11:07:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2024-11-09 11:07:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.3984375) internal successors, (179), 145 states have internal predecessors, (179), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2024-11-09 11:07:13,449 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 16 [2024-11-09 11:07:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,449 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2024-11-09 11:07:13,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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-11-09 11:07:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2024-11-09 11:07:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 11:07:13,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:07:13,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -915451047, now seen corresponding path program 1 times [2024-11-09 11:07:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21179041] [2024-11-09 11:07:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21179041] [2024-11-09 11:07:13,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21179041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:13,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870215612] [2024-11-09 11:07:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:13,509 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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-11-09 11:07:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,623 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2024-11-09 11:07:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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-11-09 11:07:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,625 INFO L225 Difference]: With dead ends: 172 [2024-11-09 11:07:13,626 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 11:07:13,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:13,627 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 11:07:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2024-11-09 11:07:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 135 states have (on average 1.3925925925925926) internal successors, (188), 152 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2024-11-09 11:07:13,641 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 16 [2024-11-09 11:07:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2024-11-09 11:07:13,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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-11-09 11:07:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2024-11-09 11:07:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:13,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,646 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:07:13,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash 820042760, now seen corresponding path program 1 times [2024-11-09 11:07:13,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:13,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200911658] [2024-11-09 11:07:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200911658] [2024-11-09 11:07:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200911658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058303739] [2024-11-09 11:07:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:13,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:13,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:13,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:13,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:07:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:13,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 11:07:13,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:13,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:07:13,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058303739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:13,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:07:13,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 11:07:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908990513] [2024-11-09 11:07:13,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:13,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:07:13,830 INFO L87 Difference]: Start difference. First operand 159 states and 196 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, (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-11-09 11:07:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:13,890 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2024-11-09 11:07:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:13,891 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, (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 17 [2024-11-09 11:07:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:13,892 INFO L225 Difference]: With dead ends: 167 [2024-11-09 11:07:13,892 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 11:07:13,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-11-09 11:07:13,893 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:13,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 282 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 11:07:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2024-11-09 11:07:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 156 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2024-11-09 11:07:13,900 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 17 [2024-11-09 11:07:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:13,901 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2024-11-09 11:07:13,901 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, (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-11-09 11:07:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2024-11-09 11:07:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 11:07:13,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:13,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:13,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:07:14,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:14,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1067314021, now seen corresponding path program 1 times [2024-11-09 11:07:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811439206] [2024-11-09 11:07:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811439206] [2024-11-09 11:07:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811439206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978030572] [2024-11-09 11:07:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:14,190 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-09 11:07:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,238 INFO L93 Difference]: Finished difference Result 328 states and 400 transitions. [2024-11-09 11:07:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 17 [2024-11-09 11:07:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,240 INFO L225 Difference]: With dead ends: 328 [2024-11-09 11:07:14,240 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 11:07:14,241 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-11-09 11:07:14,242 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 299 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 11:07:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-09 11:07:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 160 states have internal predecessors, (195), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2024-11-09 11:07:14,249 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 17 [2024-11-09 11:07:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,250 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2024-11-09 11:07:14,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-09 11:07:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2024-11-09 11:07:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:14,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,251 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:07:14,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1477206277, now seen corresponding path program 1 times [2024-11-09 11:07:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815929375] [2024-11-09 11:07:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:07:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815929375] [2024-11-09 11:07:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815929375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244160925] [2024-11-09 11:07:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:14,333 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-09 11:07:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,442 INFO L93 Difference]: Finished difference Result 231 states and 280 transitions. [2024-11-09 11:07:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2024-11-09 11:07:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,444 INFO L225 Difference]: With dead ends: 231 [2024-11-09 11:07:14,444 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 11:07:14,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-09 11:07:14,445 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 133 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 284 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 11:07:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2024-11-09 11:07:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 190 states have (on average 1.3421052631578947) internal successors, (255), 206 states have internal predecessors, (255), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 263 transitions. [2024-11-09 11:07:14,457 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 263 transitions. Word has length 24 [2024-11-09 11:07:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,457 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 263 transitions. [2024-11-09 11:07:14,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-09 11:07:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 263 transitions. [2024-11-09 11:07:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:14,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,458 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:07:14,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1448578921, now seen corresponding path program 1 times [2024-11-09 11:07:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461724694] [2024-11-09 11:07:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:07:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461724694] [2024-11-09 11:07:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461724694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640608227] [2024-11-09 11:07:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:14,523 INFO L87 Difference]: Start difference. First operand 215 states and 263 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-09 11:07:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,617 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2024-11-09 11:07:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 24 [2024-11-09 11:07:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,619 INFO L225 Difference]: With dead ends: 229 [2024-11-09 11:07:14,620 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 11:07:14,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-09 11:07:14,621 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 287 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 11:07:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 206. [2024-11-09 11:07:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 197 states have internal predecessors, (242), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 250 transitions. [2024-11-09 11:07:14,632 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 250 transitions. Word has length 24 [2024-11-09 11:07:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,632 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 250 transitions. [2024-11-09 11:07:14,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-09 11:07:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 250 transitions. [2024-11-09 11:07:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:14,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,633 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, 1, 1] [2024-11-09 11:07:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 11:07:14,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1378187940, now seen corresponding path program 1 times [2024-11-09 11:07:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462906593] [2024-11-09 11:07:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462906593] [2024-11-09 11:07:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462906593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325893554] [2024-11-09 11:07:14,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:14,707 INFO L87 Difference]: Start difference. First operand 206 states and 250 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 11:07:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,767 INFO L93 Difference]: Finished difference Result 360 states and 436 transitions. [2024-11-09 11:07:14,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:14,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2024-11-09 11:07:14,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,771 INFO L225 Difference]: With dead ends: 360 [2024-11-09 11:07:14,771 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:07:14,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-11-09 11:07:14,772 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 37 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 299 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:07:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-09 11:07:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 171 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 217 transitions. [2024-11-09 11:07:14,783 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 217 transitions. Word has length 24 [2024-11-09 11:07:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,783 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 217 transitions. [2024-11-09 11:07:14,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 11:07:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 217 transitions. [2024-11-09 11:07:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 11:07:14,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,785 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, 1, 1] [2024-11-09 11:07:14,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:07:14,786 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash -759713231, now seen corresponding path program 1 times [2024-11-09 11:07:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382244479] [2024-11-09 11:07:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:07:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382244479] [2024-11-09 11:07:14,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382244479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:14,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:14,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483053109] [2024-11-09 11:07:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:14,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:14,869 INFO L87 Difference]: Start difference. First operand 180 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-09 11:07:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:14,960 INFO L93 Difference]: Finished difference Result 347 states and 420 transitions. [2024-11-09 11:07:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2024-11-09 11:07:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:14,962 INFO L225 Difference]: With dead ends: 347 [2024-11-09 11:07:14,962 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 11:07:14,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-11-09 11:07:14,963 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 71 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:14,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 11:07:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2024-11-09 11:07:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 183 states have internal predecessors, (223), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2024-11-09 11:07:14,973 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 24 [2024-11-09 11:07:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2024-11-09 11:07:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-09 11:07:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2024-11-09 11:07:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:07:14,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:14,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:14,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 11:07:14,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:14,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1809759125, now seen corresponding path program 1 times [2024-11-09 11:07:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:14,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593367384] [2024-11-09 11:07:14,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 11:07:15,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:15,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593367384] [2024-11-09 11:07:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593367384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:15,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:15,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:07:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089039873] [2024-11-09 11:07:15,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:15,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:15,028 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 11:07:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:15,089 INFO L93 Difference]: Finished difference Result 197 states and 238 transitions. [2024-11-09 11:07:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:07:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 29 [2024-11-09 11:07:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:15,091 INFO L225 Difference]: With dead ends: 197 [2024-11-09 11:07:15,091 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 11:07:15,091 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-11-09 11:07:15,092 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 8 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:15,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 261 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 11:07:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 182. [2024-11-09 11:07:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 173 states have internal predecessors, (211), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 219 transitions. [2024-11-09 11:07:15,106 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 219 transitions. Word has length 29 [2024-11-09 11:07:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 219 transitions. [2024-11-09 11:07:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 11:07:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 219 transitions. [2024-11-09 11:07:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 11:07:15,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:15,107 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:07:15,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 30451990, now seen corresponding path program 1 times [2024-11-09 11:07:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428774613] [2024-11-09 11:07:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 11:07:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:07:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:15,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428774613] [2024-11-09 11:07:15,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428774613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:15,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837627709] [2024-11-09 11:07:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:15,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:15,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:07:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:15,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:07:15,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 11:07:15,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 11:07:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837627709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:15,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-09 11:07:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975772576] [2024-11-09 11:07:15,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:15,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 11:07:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 11:07:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-09 11:07:15,526 INFO L87 Difference]: Start difference. First operand 182 states and 219 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:07:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:15,841 INFO L93 Difference]: Finished difference Result 644 states and 814 transitions. [2024-11-09 11:07:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:07:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-09 11:07:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:15,844 INFO L225 Difference]: With dead ends: 644 [2024-11-09 11:07:15,844 INFO L226 Difference]: Without dead ends: 497 [2024-11-09 11:07:15,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:07:15,846 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 240 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:15,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 493 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:07:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-09 11:07:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 202. [2024-11-09 11:07:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 177 states have (on average 1.3276836158192091) internal successors, (235), 193 states have internal predecessors, (235), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 243 transitions. [2024-11-09 11:07:15,861 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 243 transitions. Word has length 44 [2024-11-09 11:07:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 243 transitions. [2024-11-09 11:07:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:07:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 243 transitions. [2024-11-09 11:07:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:07:15,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:15,862 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:15,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:07:16,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 11:07:16,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 919490409, now seen corresponding path program 1 times [2024-11-09 11:07:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383176978] [2024-11-09 11:07:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:07:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:07:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383176978] [2024-11-09 11:07:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383176978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855308432] [2024-11-09 11:07:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:16,140 INFO L87 Difference]: Start difference. First operand 202 states and 243 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,245 INFO L93 Difference]: Finished difference Result 206 states and 246 transitions. [2024-11-09 11:07:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:16,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-09 11:07:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,247 INFO L225 Difference]: With dead ends: 206 [2024-11-09 11:07:16,247 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 11:07:16,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-09 11:07:16,248 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 124 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 306 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 11:07:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-09 11:07:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 170 states have (on average 1.311764705882353) internal successors, (223), 183 states have internal predecessors, (223), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2024-11-09 11:07:16,263 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 47 [2024-11-09 11:07:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,263 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2024-11-09 11:07:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2024-11-09 11:07:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:07:16,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,264 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:07:16,265 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:16,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash 890863053, now seen corresponding path program 1 times [2024-11-09 11:07:16,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558805030] [2024-11-09 11:07:16,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 11:07:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:07:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558805030] [2024-11-09 11:07:16,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558805030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:16,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644711661] [2024-11-09 11:07:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:16,340 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,434 INFO L93 Difference]: Finished difference Result 200 states and 240 transitions. [2024-11-09 11:07:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-09 11:07:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,436 INFO L225 Difference]: With dead ends: 200 [2024-11-09 11:07:16,436 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 11:07:16,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-09 11:07:16,437 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 132 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 301 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 11:07:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2024-11-09 11:07:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.31055900621118) internal successors, (211), 172 states have internal predecessors, (211), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 219 transitions. [2024-11-09 11:07:16,450 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 219 transitions. Word has length 47 [2024-11-09 11:07:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 219 transitions. [2024-11-09 11:07:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 219 transitions. [2024-11-09 11:07:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:07:16,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,451 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 11:07:16,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:16,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1413588542, now seen corresponding path program 1 times [2024-11-09 11:07:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102524417] [2024-11-09 11:07:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 11:07:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102524417] [2024-11-09 11:07:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102524417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:07:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845213834] [2024-11-09 11:07:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:07:16,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:07:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:07:16,539 INFO L87 Difference]: Start difference. First operand 181 states and 219 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,599 INFO L93 Difference]: Finished difference Result 339 states and 411 transitions. [2024-11-09 11:07:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:07:16,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-09 11:07:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,600 INFO L225 Difference]: With dead ends: 339 [2024-11-09 11:07:16,601 INFO L226 Difference]: Without dead ends: 206 [2024-11-09 11:07:16,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-09 11:07:16,602 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 11 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:07:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-09 11:07:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 177. [2024-11-09 11:07:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 168 states have internal predecessors, (204), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 212 transitions. [2024-11-09 11:07:16,615 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 212 transitions. Word has length 47 [2024-11-09 11:07:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 212 transitions. [2024-11-09 11:07:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 212 transitions. [2024-11-09 11:07:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 11:07:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,616 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 11:07:16,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 841869555, now seen corresponding path program 1 times [2024-11-09 11:07:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556491036] [2024-11-09 11:07:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:16,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556491036] [2024-11-09 11:07:16,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556491036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:07:16,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:07:16,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:07:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654447519] [2024-11-09 11:07:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:07:16,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:07:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:07:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:07:16,769 INFO L87 Difference]: Start difference. First operand 177 states and 212 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:16,880 INFO L93 Difference]: Finished difference Result 390 states and 466 transitions. [2024-11-09 11:07:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:07:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-09 11:07:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:16,882 INFO L225 Difference]: With dead ends: 390 [2024-11-09 11:07:16,882 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 11:07:16,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:07:16,883 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 44 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:16,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 266 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:07:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 11:07:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 177. [2024-11-09 11:07:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 168 states have internal predecessors, (203), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2024-11-09 11:07:16,899 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 48 [2024-11-09 11:07:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2024-11-09 11:07:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:07:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2024-11-09 11:07:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 11:07:16,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:16,901 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 11:07:16,901 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash -605551017, now seen corresponding path program 1 times [2024-11-09 11:07:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700553475] [2024-11-09 11:07:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700553475] [2024-11-09 11:07:17,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700553475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959943237] [2024-11-09 11:07:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:17,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:17,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:17,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:17,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:07:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:17,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:07:17,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:17,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959943237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:18,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-09 11:07:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181576083] [2024-11-09 11:07:18,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:07:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:07:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:07:18,031 INFO L87 Difference]: Start difference. First operand 177 states and 211 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:18,746 INFO L93 Difference]: Finished difference Result 504 states and 600 transitions. [2024-11-09 11:07:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 11:07:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 11:07:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:18,749 INFO L225 Difference]: With dead ends: 504 [2024-11-09 11:07:18,749 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 11:07:18,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:07:18,750 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 153 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:18,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 672 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:07:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 11:07:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 177. [2024-11-09 11:07:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.267515923566879) internal successors, (199), 168 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 207 transitions. [2024-11-09 11:07:18,770 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 207 transitions. Word has length 53 [2024-11-09 11:07:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 207 transitions. [2024-11-09 11:07:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2024-11-09 11:07:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 11:07:18,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:18,771 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:18,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:07:18,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:18,972 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2074570641, now seen corresponding path program 1 times [2024-11-09 11:07:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385469781] [2024-11-09 11:07:18,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:19,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385469781] [2024-11-09 11:07:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385469781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894833399] [2024-11-09 11:07:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:19,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:19,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:19,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:07:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:19,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 11:07:19,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:19,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894833399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:19,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-09 11:07:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018233667] [2024-11-09 11:07:19,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:19,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 11:07:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 11:07:19,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-11-09 11:07:19,724 INFO L87 Difference]: Start difference. First operand 177 states and 207 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:20,252 INFO L93 Difference]: Finished difference Result 961 states and 1195 transitions. [2024-11-09 11:07:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 11:07:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-09 11:07:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:20,256 INFO L225 Difference]: With dead ends: 961 [2024-11-09 11:07:20,257 INFO L226 Difference]: Without dead ends: 839 [2024-11-09 11:07:20,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-11-09 11:07:20,258 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 458 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:20,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 752 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:07:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-11-09 11:07:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 217. [2024-11-09 11:07:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 197 states have (on average 1.2538071065989849) internal successors, (247), 208 states have internal predecessors, (247), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2024-11-09 11:07:20,283 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 64 [2024-11-09 11:07:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:20,284 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2024-11-09 11:07:20,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2024-11-09 11:07:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 11:07:20,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:20,285 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:20,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:07:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:20,486 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1898395305, now seen corresponding path program 2 times [2024-11-09 11:07:20,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412142074] [2024-11-09 11:07:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412142074] [2024-11-09 11:07:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412142074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161340004] [2024-11-09 11:07:20,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:07:20,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:20,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:20,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:20,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:07:21,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:07:21,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:07:21,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 11:07:21,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:22,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161340004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:25,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-11-09 11:07:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637005664] [2024-11-09 11:07:25,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:25,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 11:07:25,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:25,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 11:07:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 11:07:25,186 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:32,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:07:33,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 11:07:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:37,352 INFO L93 Difference]: Finished difference Result 712 states and 844 transitions. [2024-11-09 11:07:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 11:07:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-09 11:07:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:37,355 INFO L225 Difference]: With dead ends: 712 [2024-11-09 11:07:37,355 INFO L226 Difference]: Without dead ends: 562 [2024-11-09 11:07:37,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 11:07:37,357 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 400 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 125 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:37,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1685 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1042 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2024-11-09 11:07:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-09 11:07:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 217. [2024-11-09 11:07:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 197 states have (on average 1.2131979695431472) internal successors, (239), 208 states have internal predecessors, (239), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2024-11-09 11:07:37,379 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 73 [2024-11-09 11:07:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:37,379 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2024-11-09 11:07:37,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:07:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2024-11-09 11:07:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 11:07:37,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:37,383 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:37,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:07:37,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:37,584 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1676227985, now seen corresponding path program 2 times [2024-11-09 11:07:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963389057] [2024-11-09 11:07:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:37,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:38,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963389057] [2024-11-09 11:07:38,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963389057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458946518] [2024-11-09 11:07:38,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:07:38,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:38,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:07:38,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:07:38,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:07:38,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 11:07:38,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:38,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:39,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458946518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:39,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:39,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-11-09 11:07:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555941066] [2024-11-09 11:07:39,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 11:07:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 11:07:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 11:07:39,378 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:07:40,209 INFO L93 Difference]: Finished difference Result 1681 states and 2107 transitions. [2024-11-09 11:07:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 11:07:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-09 11:07:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:07:40,217 INFO L225 Difference]: With dead ends: 1681 [2024-11-09 11:07:40,217 INFO L226 Difference]: Without dead ends: 1559 [2024-11-09 11:07:40,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 11:07:40,219 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1361 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:07:40,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 638 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:07:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-09 11:07:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 297. [2024-11-09 11:07:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 277 states have (on average 1.2093862815884477) internal successors, (335), 288 states have internal predecessors, (335), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 11:07:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 343 transitions. [2024-11-09 11:07:40,251 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 343 transitions. Word has length 104 [2024-11-09 11:07:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:07:40,251 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 343 transitions. [2024-11-09 11:07:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 11:07:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 343 transitions. [2024-11-09 11:07:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 11:07:40,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:07:40,253 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:07:40,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:07:40,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 11:07:40,458 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 11:07:40,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:07:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -260321449, now seen corresponding path program 3 times [2024-11-09 11:07:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:07:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889014663] [2024-11-09 11:07:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:07:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:07:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:07:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 11:07:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:07:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:07:41,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889014663] [2024-11-09 11:07:41,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889014663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:07:41,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316426251] [2024-11-09 11:07:41,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:07:41,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:07:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:07:41,422 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:07:41,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:07:41,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-09 11:07:41,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:07:41,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 11:07:41,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:07:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:45,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:07:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:07:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316426251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:07:54,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:07:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-11-09 11:07:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577628679] [2024-11-09 11:07:54,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:07:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-09 11:07:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:07:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-09 11:07:54,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-11-09 11:07:54,223 INFO L87 Difference]: Start difference. First operand 297 states and 343 transitions. Second operand has 80 states, 80 states have (on average 3.3625) internal successors, (269), 80 states have internal predecessors, (269), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)