./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_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-dev-4a390ef-m [2024-10-24 19:35:10,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:35:10,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 19:35:10,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:35:10,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:35:10,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:35:10,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:35:10,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:35:10,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:35:10,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:35:10,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:35:10,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:35:10,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:35:10,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:35:10,776 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:35:10,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:35:10,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 19:35:10,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:35:10,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:35:10,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:35:10,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:35:10,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 19:35:10,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:35:10,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 19:35:10,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:35:10,781 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 19:35:10,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:35:10,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:35:10,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 19:35:10,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:35:10,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:35:10,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:35:10,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:35:10,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:35:10,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:10,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:35:10,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:35:10,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 19:35:10,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:35:10,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:35:10,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:35:10,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:35:10,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:35:10,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:35:10,791 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-10-24 19:35:11,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:35:11,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:35:11,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:35:11,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:35:11,095 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:35:11,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2024-10-24 19:35:12,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:35:12,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:35:12,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2024-10-24 19:35:12,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0afca96/70d1712feb5640fdbd40cdc6d95d7f65/FLAG582f8091e [2024-10-24 19:35:13,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0afca96/70d1712feb5640fdbd40cdc6d95d7f65 [2024-10-24 19:35:13,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:35:13,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:35:13,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:13,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:35:13,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:35:13,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c5b549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13, skipping insertion in model container [2024-10-24 19:35:13,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:35:13,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:13,472 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:35:13,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:35:13,528 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:35:13,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13 WrapperNode [2024-10-24 19:35:13,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:35:13,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:13,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:35:13,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:35:13,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,589 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-10-24 19:35:13,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:35:13,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:35:13,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:35:13,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:35:13,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 19:35:13,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:35:13,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:35:13,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:35:13,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:35:13,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (1/1) ... [2024-10-24 19:35:13,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:35:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:13,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:35:13,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:35:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:35:13,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:35:13,741 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-24 19:35:13,741 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-24 19:35:13,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:35:13,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:35:13,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 19:35:13,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 19:35:13,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:35:13,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:35:14,275 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-10-24 19:35:14,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:35:14,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:35:14,326 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 19:35:14,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:14 BoogieIcfgContainer [2024-10-24 19:35:14,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:35:14,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:35:14,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:35:14,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:35:14,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:35:13" (1/3) ... [2024-10-24 19:35:14,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:14, skipping insertion in model container [2024-10-24 19:35:14,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:35:13" (2/3) ... [2024-10-24 19:35:14,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12db8b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:35:14, skipping insertion in model container [2024-10-24 19:35:14,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:35:14" (3/3) ... [2024-10-24 19:35:14,339 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2024-10-24 19:35:14,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:35:14,358 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-24 19:35:14,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:35:14,425 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;@33e234d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:35:14,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-24 19:35:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 108 states have internal predecessors, (142), 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-10-24 19:35:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 19:35:14,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -591187294, now seen corresponding path program 1 times [2024-10-24 19:35:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845622098] [2024-10-24 19:35:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845622098] [2024-10-24 19:35:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845622098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:14,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:14,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328177859] [2024-10-24 19:35:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:14,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:14,715 INFO L87 Difference]: Start difference. First operand has 115 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 108 states have internal predecessors, (142), 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.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:14,884 INFO L93 Difference]: Finished difference Result 281 states and 395 transitions. [2024-10-24 19:35:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:14,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-24 19:35:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:14,896 INFO L225 Difference]: With dead ends: 281 [2024-10-24 19:35:14,896 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 19:35:14,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:14,903 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 87 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:14,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 360 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 19:35:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2024-10-24 19:35:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 131 states have internal predecessors, (169), 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-10-24 19:35:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 177 transitions. [2024-10-24 19:35:14,948 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 177 transitions. Word has length 8 [2024-10-24 19:35:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:14,949 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 177 transitions. [2024-10-24 19:35:14,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 177 transitions. [2024-10-24 19:35:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 19:35:14,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:14,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:14,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:35:14,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:14,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 253628062, now seen corresponding path program 1 times [2024-10-24 19:35:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:14,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182294862] [2024-10-24 19:35:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:15,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182294862] [2024-10-24 19:35:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182294862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844019540] [2024-10-24 19:35:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:15,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:15,039 INFO L87 Difference]: Start difference. First operand 138 states and 177 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:15,112 INFO L93 Difference]: Finished difference Result 286 states and 374 transitions. [2024-10-24 19:35:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:15,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 19:35:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:15,115 INFO L225 Difference]: With dead ends: 286 [2024-10-24 19:35:15,115 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 19:35:15,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:15,120 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:15,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 19:35:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2024-10-24 19:35:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 135 states have internal predecessors, (173), 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-10-24 19:35:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2024-10-24 19:35:15,150 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 13 [2024-10-24 19:35:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:15,151 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2024-10-24 19:35:15,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2024-10-24 19:35:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 19:35:15,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:15,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:15,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:35:15,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash 253516716, now seen corresponding path program 1 times [2024-10-24 19:35:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153557064] [2024-10-24 19:35:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 19:35:15,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153557064] [2024-10-24 19:35:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153557064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:15,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795292339] [2024-10-24 19:35:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:15,244 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:15,302 INFO L93 Difference]: Finished difference Result 142 states and 181 transitions. [2024-10-24 19:35:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 19:35:15,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:15,308 INFO L225 Difference]: With dead ends: 142 [2024-10-24 19:35:15,308 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 19:35:15,309 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-10-24 19:35:15,310 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:15,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 184 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 19:35:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-10-24 19:35:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 134 states have internal predecessors, (171), 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-10-24 19:35:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2024-10-24 19:35:15,332 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 13 [2024-10-24 19:35:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2024-10-24 19:35:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2024-10-24 19:35:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:15,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:15,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:15,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:35:15,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1948779024, now seen corresponding path program 1 times [2024-10-24 19:35:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876796761] [2024-10-24 19:35:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:15,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876796761] [2024-10-24 19:35:15,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876796761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:15,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924080690] [2024-10-24 19:35:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:15,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:15,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:15,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 19:35:15,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 19:35:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:15,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:15,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:15,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924080690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 19:35:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402554687] [2024-10-24 19:35:15,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:15,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:15,578 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:15,662 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2024-10-24 19:35:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 19:35:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:15,664 INFO L225 Difference]: With dead ends: 167 [2024-10-24 19:35:15,664 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 19:35:15,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-10-24 19:35:15,665 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 25 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:15,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 265 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 19:35:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2024-10-24 19:35:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 141 states have internal predecessors, (178), 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-10-24 19:35:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 186 transitions. [2024-10-24 19:35:15,682 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 186 transitions. Word has length 14 [2024-10-24 19:35:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:15,682 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 186 transitions. [2024-10-24 19:35:15,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 186 transitions. [2024-10-24 19:35:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 19:35:15,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:15,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:15,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 19:35:15,887 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-10-24 19:35:15,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:15,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -730916339, now seen corresponding path program 1 times [2024-10-24 19:35:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:15,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564730744] [2024-10-24 19:35:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564730744] [2024-10-24 19:35:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564730744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058021655] [2024-10-24 19:35:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:15,985 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-10-24 19:35:15,990 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-10-24 19:35:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:16,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:16,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058021655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-24 19:35:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236618152] [2024-10-24 19:35:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:16,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:16,074 INFO L87 Difference]: Start difference. First operand 148 states and 186 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-10-24 19:35:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:16,134 INFO L93 Difference]: Finished difference Result 154 states and 194 transitions. [2024-10-24 19:35:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:16,135 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 14 [2024-10-24 19:35:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:16,136 INFO L225 Difference]: With dead ends: 154 [2024-10-24 19:35:16,136 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 19:35:16,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:16,137 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:16,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 175 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 19:35:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-10-24 19:35:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.44) internal successors, (180), 143 states have internal predecessors, (180), 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-10-24 19:35:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2024-10-24 19:35:16,156 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 14 [2024-10-24 19:35:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:16,156 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2024-10-24 19:35:16,156 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-10-24 19:35:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2024-10-24 19:35:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:16,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:16,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:16,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 19:35:16,357 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-10-24 19:35:16,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 282607693, now seen corresponding path program 1 times [2024-10-24 19:35:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986425809] [2024-10-24 19:35:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 19:35:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986425809] [2024-10-24 19:35:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986425809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:16,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:35:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102922644] [2024-10-24 19:35:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:16,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:16,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:16,399 INFO L87 Difference]: Start difference. First operand 150 states and 188 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-10-24 19:35:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:16,439 INFO L93 Difference]: Finished difference Result 150 states and 188 transitions. [2024-10-24 19:35:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:16,441 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 15 [2024-10-24 19:35:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:16,442 INFO L225 Difference]: With dead ends: 150 [2024-10-24 19:35:16,442 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 19:35:16,442 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-10-24 19:35:16,443 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:16,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 19:35:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-10-24 19:35:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 140 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-10-24 19:35:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2024-10-24 19:35:16,459 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 15 [2024-10-24 19:35:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:16,460 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2024-10-24 19:35:16,460 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-10-24 19:35:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2024-10-24 19:35:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:16,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:16,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:16,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:35:16,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:16,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash -455355172, now seen corresponding path program 1 times [2024-10-24 19:35:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130407918] [2024-10-24 19:35:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:16,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130407918] [2024-10-24 19:35:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130407918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671504612] [2024-10-24 19:35:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:35:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:35:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:16,510 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:16,556 INFO L93 Difference]: Finished difference Result 300 states and 381 transitions. [2024-10-24 19:35:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:35:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 19:35:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:16,557 INFO L225 Difference]: With dead ends: 300 [2024-10-24 19:35:16,557 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 19:35:16,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:35:16,559 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:16,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 19:35:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2024-10-24 19:35:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 125 states have (on average 1.408) internal successors, (176), 142 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-10-24 19:35:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2024-10-24 19:35:16,572 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 15 [2024-10-24 19:35:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:16,572 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2024-10-24 19:35:16,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2024-10-24 19:35:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 19:35:16,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:16,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:16,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:35:16,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:16,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1074868571, now seen corresponding path program 1 times [2024-10-24 19:35:16,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:16,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875766138] [2024-10-24 19:35:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:16,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875766138] [2024-10-24 19:35:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875766138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:16,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:16,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535273385] [2024-10-24 19:35:16,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:16,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:16,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:16,657 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 5 states, 4 states have (on average 3.5) 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-10-24 19:35:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:16,783 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2024-10-24 19:35:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) 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-10-24 19:35:16,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:16,785 INFO L225 Difference]: With dead ends: 168 [2024-10-24 19:35:16,785 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 19:35:16,785 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-10-24 19:35:16,786 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 102 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:16,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 338 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 19:35:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2024-10-24 19:35:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 149 states have internal predecessors, (185), 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-10-24 19:35:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-10-24 19:35:16,798 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 15 [2024-10-24 19:35:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:16,802 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-10-24 19:35:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) 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-10-24 19:35:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-10-24 19:35:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:16,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:16,803 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:16,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:35:16,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:16,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash 173066812, now seen corresponding path program 1 times [2024-10-24 19:35:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577963886] [2024-10-24 19:35:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577963886] [2024-10-24 19:35:16,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577963886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646228602] [2024-10-24 19:35:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:16,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:16,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:16,854 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-10-24 19:35:16,855 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-10-24 19:35:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:16,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 19:35:16,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:16,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 19:35:16,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646228602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:16,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 19:35:16,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-24 19:35:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666554700] [2024-10-24 19:35:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:16,938 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:16,995 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2024-10-24 19:35:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 19:35:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:16,997 INFO L225 Difference]: With dead ends: 164 [2024-10-24 19:35:16,997 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 19:35:16,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:35:16,998 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:16,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 191 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 19:35:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-10-24 19:35:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 153 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-10-24 19:35:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 196 transitions. [2024-10-24 19:35:17,005 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 196 transitions. Word has length 16 [2024-10-24 19:35:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 196 transitions. [2024-10-24 19:35:17,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2024-10-24 19:35:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 19:35:17,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:17,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:17,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:17,210 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-10-24 19:35:17,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 420338073, now seen corresponding path program 1 times [2024-10-24 19:35:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821374843] [2024-10-24 19:35:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821374843] [2024-10-24 19:35:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821374843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128238906] [2024-10-24 19:35:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:17,271 INFO L87 Difference]: Start difference. First operand 160 states and 196 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:17,321 INFO L93 Difference]: Finished difference Result 322 states and 394 transitions. [2024-10-24 19:35:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-24 19:35:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:17,322 INFO L225 Difference]: With dead ends: 322 [2024-10-24 19:35:17,322 INFO L226 Difference]: Without dead ends: 164 [2024-10-24 19:35:17,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:17,324 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:17,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 287 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-24 19:35:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-24 19:35:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 156 states have internal predecessors, (191), 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-10-24 19:35:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2024-10-24 19:35:17,330 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 16 [2024-10-24 19:35:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:17,331 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2024-10-24 19:35:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:35:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2024-10-24 19:35:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:17,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:17,331 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:17,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:35:17,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:17,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1128687471, now seen corresponding path program 1 times [2024-10-24 19:35:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:17,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517480560] [2024-10-24 19:35:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:35:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517480560] [2024-10-24 19:35:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517480560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:17,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436428488] [2024-10-24 19:35:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:17,402 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:17,509 INFO L93 Difference]: Finished difference Result 224 states and 273 transitions. [2024-10-24 19:35:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-24 19:35:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:17,511 INFO L225 Difference]: With dead ends: 224 [2024-10-24 19:35:17,511 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 19:35:17,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:17,512 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 130 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:17,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 269 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 19:35:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2024-10-24 19:35:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 201 states have internal predecessors, (250), 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-10-24 19:35:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2024-10-24 19:35:17,524 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 21 [2024-10-24 19:35:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2024-10-24 19:35:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2024-10-24 19:35:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 19:35:17,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:17,526 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:17,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 19:35:17,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:17,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1157314827, now seen corresponding path program 1 times [2024-10-24 19:35:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:17,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548846626] [2024-10-24 19:35:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:17,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:35:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:17,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548846626] [2024-10-24 19:35:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548846626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845693826] [2024-10-24 19:35:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:17,586 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:17,685 INFO L93 Difference]: Finished difference Result 222 states and 268 transitions. [2024-10-24 19:35:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-24 19:35:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:17,688 INFO L225 Difference]: With dead ends: 222 [2024-10-24 19:35:17,688 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 19:35:17,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:17,689 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 132 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:17,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 272 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 19:35:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2024-10-24 19:35:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3465909090909092) internal successors, (237), 192 states have internal predecessors, (237), 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-10-24 19:35:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2024-10-24 19:35:17,700 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 21 [2024-10-24 19:35:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:17,700 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2024-10-24 19:35:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 19:35:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2024-10-24 19:35:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 19:35:17,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:17,701 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:17,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 19:35:17,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:17,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1323400201, now seen corresponding path program 1 times [2024-10-24 19:35:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:17,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062645793] [2024-10-24 19:35:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062645793] [2024-10-24 19:35:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062645793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778574] [2024-10-24 19:35:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:17,776 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:17,833 INFO L93 Difference]: Finished difference Result 352 states and 428 transitions. [2024-10-24 19:35:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2024-10-24 19:35:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:17,834 INFO L225 Difference]: With dead ends: 352 [2024-10-24 19:35:17,834 INFO L226 Difference]: Without dead ends: 178 [2024-10-24 19:35:17,835 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-10-24 19:35:17,835 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 36 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:17,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 283 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-24 19:35:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-10-24 19:35:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.36) internal successors, (204), 166 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-10-24 19:35:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 212 transitions. [2024-10-24 19:35:17,843 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 212 transitions. Word has length 22 [2024-10-24 19:35:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:17,844 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 212 transitions. [2024-10-24 19:35:17,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 212 transitions. [2024-10-24 19:35:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 19:35:17,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:17,844 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:17,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:35:17,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:17,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1941874910, now seen corresponding path program 1 times [2024-10-24 19:35:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:17,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909012123] [2024-10-24 19:35:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:17,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:35:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:17,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909012123] [2024-10-24 19:35:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909012123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:17,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:17,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889337391] [2024-10-24 19:35:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:17,914 INFO L87 Difference]: Start difference. First operand 175 states and 212 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:18,008 INFO L93 Difference]: Finished difference Result 339 states and 412 transitions. [2024-10-24 19:35:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2024-10-24 19:35:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:18,009 INFO L225 Difference]: With dead ends: 339 [2024-10-24 19:35:18,009 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 19:35:18,010 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-10-24 19:35:18,010 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 68 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:18,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 343 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 19:35:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-10-24 19:35:18,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 162 states have (on average 1.345679012345679) internal successors, (218), 178 states have internal predecessors, (218), 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-10-24 19:35:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2024-10-24 19:35:18,021 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 22 [2024-10-24 19:35:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:18,021 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2024-10-24 19:35:18,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2024-10-24 19:35:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 19:35:18,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:18,023 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] [2024-10-24 19:35:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:35:18,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1844963592, now seen corresponding path program 1 times [2024-10-24 19:35:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197870415] [2024-10-24 19:35:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 19:35:18,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197870415] [2024-10-24 19:35:18,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197870415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:18,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:18,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:35:18,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567964945] [2024-10-24 19:35:18,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:18,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:18,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:18,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:18,070 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:18,128 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2024-10-24 19:35:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:35:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 27 [2024-10-24 19:35:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:18,130 INFO L225 Difference]: With dead ends: 192 [2024-10-24 19:35:18,130 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 19:35:18,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:18,131 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:18,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 249 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 19:35:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2024-10-24 19:35:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 152 states have (on average 1.355263157894737) internal successors, (206), 168 states have internal predecessors, (206), 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-10-24 19:35:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 214 transitions. [2024-10-24 19:35:18,143 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 214 transitions. Word has length 27 [2024-10-24 19:35:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:18,143 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 214 transitions. [2024-10-24 19:35:18,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 19:35:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 214 transitions. [2024-10-24 19:35:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 19:35:18,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:18,144 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] [2024-10-24 19:35:18,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 19:35:18,145 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1777249087, now seen corresponding path program 1 times [2024-10-24 19:35:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328928881] [2024-10-24 19:35:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 19:35:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 19:35:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328928881] [2024-10-24 19:35:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328928881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601239183] [2024-10-24 19:35:18,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:18,273 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-10-24 19:35:18,274 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-10-24 19:35:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:18,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 19:35:18,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 19:35:18,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 19:35:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601239183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:18,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-24 19:35:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262256071] [2024-10-24 19:35:18,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:18,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 19:35:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 19:35:18,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-24 19:35:18,572 INFO L87 Difference]: Start difference. First operand 177 states and 214 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-10-24 19:35:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:18,878 INFO L93 Difference]: Finished difference Result 627 states and 797 transitions. [2024-10-24 19:35:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 19:35:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 40 [2024-10-24 19:35:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:18,881 INFO L225 Difference]: With dead ends: 627 [2024-10-24 19:35:18,881 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 19:35:18,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 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-10-24 19:35:18,882 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 207 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:18,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 480 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 19:35:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 19:35:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 197. [2024-10-24 19:35:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 188 states have internal predecessors, (230), 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-10-24 19:35:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 238 transitions. [2024-10-24 19:35:18,897 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 238 transitions. Word has length 40 [2024-10-24 19:35:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 238 transitions. [2024-10-24 19:35:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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-10-24 19:35:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 238 transitions. [2024-10-24 19:35:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 19:35:18,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:18,898 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:18,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 19:35:19,101 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-10-24 19:35:19,102 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1819530152, now seen corresponding path program 1 times [2024-10-24 19:35:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886917147] [2024-10-24 19:35:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:35:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:35:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886917147] [2024-10-24 19:35:19,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886917147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:19,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:19,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397682430] [2024-10-24 19:35:19,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:19,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:19,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:19,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:19,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:19,186 INFO L87 Difference]: Start difference. First operand 197 states and 238 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-24 19:35:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:19,290 INFO L93 Difference]: Finished difference Result 200 states and 240 transitions. [2024-10-24 19:35:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 43 [2024-10-24 19:35:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:19,291 INFO L225 Difference]: With dead ends: 200 [2024-10-24 19:35:19,291 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 19:35:19,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:19,292 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 121 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:19,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 291 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 19:35:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2024-10-24 19:35:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 165 states have (on average 1.3212121212121213) internal successors, (218), 178 states have internal predecessors, (218), 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-10-24 19:35:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2024-10-24 19:35:19,305 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 43 [2024-10-24 19:35:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:19,306 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2024-10-24 19:35:19,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-24 19:35:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2024-10-24 19:35:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 19:35:19,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:19,307 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-24 19:35:19,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 19:35:19,307 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:19,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1848157508, now seen corresponding path program 1 times [2024-10-24 19:35:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045654477] [2024-10-24 19:35:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 19:35:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 19:35:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045654477] [2024-10-24 19:35:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045654477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:19,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794305591] [2024-10-24 19:35:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:19,377 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-24 19:35:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:19,474 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-10-24 19:35:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 43 [2024-10-24 19:35:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:19,476 INFO L225 Difference]: With dead ends: 194 [2024-10-24 19:35:19,476 INFO L226 Difference]: Without dead ends: 192 [2024-10-24 19:35:19,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:35:19,477 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 129 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:19,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 286 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-24 19:35:19,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 176. [2024-10-24 19:35:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 167 states have internal predecessors, (206), 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-10-24 19:35:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2024-10-24 19:35:19,490 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 43 [2024-10-24 19:35:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:19,490 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2024-10-24 19:35:19,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-10-24 19:35:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2024-10-24 19:35:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 19:35:19,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:19,491 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:19,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 19:35:19,492 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash 394017632, now seen corresponding path program 1 times [2024-10-24 19:35:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715762409] [2024-10-24 19:35:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 19:35:19,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:19,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715762409] [2024-10-24 19:35:19,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715762409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:19,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:19,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:35:19,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50728066] [2024-10-24 19:35:19,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:19,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:35:19,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:35:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:35:19,578 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-10-24 19:35:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:19,645 INFO L93 Difference]: Finished difference Result 326 states and 398 transitions. [2024-10-24 19:35:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:35:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 44 [2024-10-24 19:35:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:19,647 INFO L225 Difference]: With dead ends: 326 [2024-10-24 19:35:19,647 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 19:35:19,647 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-10-24 19:35:19,648 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:19,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 266 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 19:35:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 19:35:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2024-10-24 19:35:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 163 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-10-24 19:35:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2024-10-24 19:35:19,661 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 44 [2024-10-24 19:35:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:19,661 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2024-10-24 19:35:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-10-24 19:35:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2024-10-24 19:35:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 19:35:19,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:19,662 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 19:35:19,662 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -948416043, now seen corresponding path program 1 times [2024-10-24 19:35:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728076186] [2024-10-24 19:35:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728076186] [2024-10-24 19:35:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728076186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:35:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:35:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:35:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667198280] [2024-10-24 19:35:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:35:19,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:35:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:35:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:35:19,795 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-10-24 19:35:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:19,924 INFO L93 Difference]: Finished difference Result 374 states and 450 transitions. [2024-10-24 19:35:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:35:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 45 [2024-10-24 19:35:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:19,926 INFO L225 Difference]: With dead ends: 374 [2024-10-24 19:35:19,926 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 19:35:19,927 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-10-24 19:35:19,927 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 39 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:19,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 303 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 19:35:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 19:35:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 172. [2024-10-24 19:35:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 163 states have internal predecessors, (198), 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-10-24 19:35:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2024-10-24 19:35:19,947 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 45 [2024-10-24 19:35:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:19,947 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2024-10-24 19:35:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-10-24 19:35:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2024-10-24 19:35:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 19:35:19,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:19,948 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-24 19:35:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 19:35:19,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 421036651, now seen corresponding path program 1 times [2024-10-24 19:35:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189124451] [2024-10-24 19:35:19,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:20,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189124451] [2024-10-24 19:35:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189124451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468658198] [2024-10-24 19:35:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:20,183 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-10-24 19:35:20,184 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-10-24 19:35:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:20,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 19:35:20,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:20,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:20,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468658198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:20,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:20,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-10-24 19:35:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16184969] [2024-10-24 19:35:20,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:20,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 19:35:20,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:20,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 19:35:20,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-24 19:35:20,780 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-10-24 19:35:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:21,410 INFO L93 Difference]: Finished difference Result 476 states and 572 transitions. [2024-10-24 19:35:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 19:35:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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 50 [2024-10-24 19:35:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:21,412 INFO L225 Difference]: With dead ends: 476 [2024-10-24 19:35:21,412 INFO L226 Difference]: Without dead ends: 332 [2024-10-24 19:35:21,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-10-24 19:35:21,413 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 237 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:21,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 520 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 19:35:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-24 19:35:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 172. [2024-10-24 19:35:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 163 states have internal predecessors, (194), 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-10-24 19:35:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2024-10-24 19:35:21,435 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 50 [2024-10-24 19:35:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:21,436 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2024-10-24 19:35:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-10-24 19:35:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2024-10-24 19:35:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 19:35:21,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:21,437 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2024-10-24 19:35:21,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 19:35:21,640 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-10-24 19:35:21,641 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash -432601895, now seen corresponding path program 1 times [2024-10-24 19:35:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:21,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513434349] [2024-10-24 19:35:21,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513434349] [2024-10-24 19:35:21,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513434349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41873070] [2024-10-24 19:35:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:21,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:21,844 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-10-24 19:35:21,846 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-10-24 19:35:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:21,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 19:35:21,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:22,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41873070] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:22,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-24 19:35:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030069974] [2024-10-24 19:35:22,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:22,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 19:35:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 19:35:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-10-24 19:35:22,339 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 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-10-24 19:35:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:22,867 INFO L93 Difference]: Finished difference Result 944 states and 1178 transitions. [2024-10-24 19:35:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 19:35:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 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 61 [2024-10-24 19:35:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:22,871 INFO L225 Difference]: With dead ends: 944 [2024-10-24 19:35:22,872 INFO L226 Difference]: Without dead ends: 826 [2024-10-24 19:35:22,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 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-10-24 19:35:22,873 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 462 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:22,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 777 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 19:35:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-10-24 19:35:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 212. [2024-10-24 19:35:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.2604166666666667) internal successors, (242), 203 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-10-24 19:35:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2024-10-24 19:35:22,906 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 61 [2024-10-24 19:35:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:22,907 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2024-10-24 19:35:22,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 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-10-24 19:35:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2024-10-24 19:35:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 19:35:22,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:22,908 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:22,932 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-10-24 19:35:23,109 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-10-24 19:35:23,110 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:23,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1377040661, now seen corresponding path program 2 times [2024-10-24 19:35:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:23,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849124479] [2024-10-24 19:35:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849124479] [2024-10-24 19:35:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849124479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180457460] [2024-10-24 19:35:23,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:35:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:23,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:23,530 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-10-24 19:35:23,532 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-10-24 19:35:23,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:35:23,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:35:23,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 19:35:23,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:25,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180457460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:27,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-10-24 19:35:27,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638042711] [2024-10-24 19:35:27,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-24 19:35:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-24 19:35:27,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 19:35:27,054 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 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-10-24 19:35:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:34,515 INFO L93 Difference]: Finished difference Result 666 states and 798 transitions. [2024-10-24 19:35:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-24 19:35:34,516 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 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 70 [2024-10-24 19:35:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:34,518 INFO L225 Difference]: With dead ends: 666 [2024-10-24 19:35:34,518 INFO L226 Difference]: Without dead ends: 520 [2024-10-24 19:35:34,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 19:35:34,521 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 273 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:34,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1539 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-24 19:35:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-24 19:35:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 212. [2024-10-24 19:35:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.21875) internal successors, (234), 203 states have internal predecessors, (234), 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-10-24 19:35:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2024-10-24 19:35:34,546 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 70 [2024-10-24 19:35:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:34,546 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2024-10-24 19:35:34,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.5609756097560976) internal successors, (146), 41 states have internal predecessors, (146), 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-10-24 19:35:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2024-10-24 19:35:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 19:35:34,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:34,549 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2024-10-24 19:35:34,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 19:35:34,749 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-10-24 19:35:34,750 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 460823513, now seen corresponding path program 2 times [2024-10-24 19:35:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608668090] [2024-10-24 19:35:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608668090] [2024-10-24 19:35:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608668090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577738133] [2024-10-24 19:35:35,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 19:35:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:35,273 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-10-24 19:35:35,275 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-10-24 19:35:35,339 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 19:35:35,339 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:35:35,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 19:35:35,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:35,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 8 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577738133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:36,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-10-24 19:35:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684302091] [2024-10-24 19:35:36,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 19:35:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:36,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 19:35:36,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 19:35:36,259 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 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-10-24 19:35:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 19:35:37,153 INFO L93 Difference]: Finished difference Result 1664 states and 2090 transitions. [2024-10-24 19:35:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-24 19:35:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 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 101 [2024-10-24 19:35:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 19:35:37,159 INFO L225 Difference]: With dead ends: 1664 [2024-10-24 19:35:37,159 INFO L226 Difference]: Without dead ends: 1546 [2024-10-24 19:35:37,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-10-24 19:35:37,162 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1120 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 19:35:37,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 882 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 19:35:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-24 19:35:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 292. [2024-10-24 19:35:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 272 states have (on average 1.213235294117647) internal successors, (330), 283 states have internal predecessors, (330), 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-10-24 19:35:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 338 transitions. [2024-10-24 19:35:37,197 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 338 transitions. Word has length 101 [2024-10-24 19:35:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 19:35:37,197 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 338 transitions. [2024-10-24 19:35:37,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.96) internal successors, (248), 50 states have internal predecessors, (248), 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-10-24 19:35:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 338 transitions. [2024-10-24 19:35:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 19:35:37,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 19:35:37,198 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:35:37,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 19:35:37,399 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-10-24 19:35:37,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-24 19:35:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:35:37,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1301983253, now seen corresponding path program 3 times [2024-10-24 19:35:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:35:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755473868] [2024-10-24 19:35:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:35:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:35:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 19:35:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:37,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 19:35:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:35:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:35:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755473868] [2024-10-24 19:35:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755473868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 19:35:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615957698] [2024-10-24 19:35:38,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 19:35:38,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 19:35:38,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:35:38,255 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-10-24 19:35:38,257 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-10-24 19:35:38,653 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-10-24 19:35:38,653 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 19:35:38,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 19:35:38,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 19:35:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:41,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 19:35:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 17 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 19:35:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615957698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 19:35:51,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 19:35:51,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-10-24 19:35:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084808856] [2024-10-24 19:35:51,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 19:35:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-10-24 19:35:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:35:51,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-10-24 19:35:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-10-24 19:35:51,079 INFO L87 Difference]: Start difference. First operand 292 states and 338 transitions. Second operand has 80 states, 80 states have (on average 3.3125) internal successors, (265), 80 states have internal predecessors, (265), 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)