./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_2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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_2.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 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:07:42,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:07:42,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:07:42,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:07:42,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:07:42,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:07:42,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:07:42,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:07:42,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:07:42,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:07:42,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:07:42,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:07:42,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:07:42,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:07:42,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:07:42,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:07:42,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:07:42,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:07:42,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:07:42,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:07:42,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:07:42,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:07:42,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:07:42,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:07:42,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:07:42,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:07:42,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:07:42,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:07:42,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:07:42,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:42,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:07:42,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:07:42,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:07:42,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:07:42,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:07:42,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:07:42,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:07:42,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:07:42,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:07:42,815 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 -> 31f10835cae624a55ab7ddafebce266aec4d698d20be3ba19631eaedd9136bff [2024-10-14 20:07:43,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:07:43,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:07:43,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:07:43,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:07:43,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:07:43,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-10-14 20:07:44,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:07:44,552 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:07:44,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2.c.cil.c [2024-10-14 20:07:44,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035d5004d/a5baed988bf24a84ae12de8ebca6087a/FLAG386bb1d9d [2024-10-14 20:07:44,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035d5004d/a5baed988bf24a84ae12de8ebca6087a [2024-10-14 20:07:44,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:07:44,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:07:44,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:44,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:07:44,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:07:44,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:44" (1/1) ... [2024-10-14 20:07:44,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784ac74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:44, skipping insertion in model container [2024-10-14 20:07:44,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:07:44" (1/1) ... [2024-10-14 20:07:44,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:07:45,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:45,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:07:45,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:07:45,185 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:07:45,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45 WrapperNode [2024-10-14 20:07:45,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:07:45,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:45,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:07:45,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:07:45,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,242 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-10-14 20:07:45,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:07:45,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:07:45,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:07:45,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:07:45,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,279 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-14 20:07:45,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:07:45,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:07:45,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:07:45,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:07:45,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (1/1) ... [2024-10-14 20:07:45,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:07:45,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:45,333 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-14 20:07:45,342 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-14 20:07:45,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:07:45,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:07:45,381 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-14 20:07:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-14 20:07:45,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:07:45,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:07:45,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:07:45,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:07:45,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:07:45,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:07:45,836 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-14 20:07:45,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:07:45,861 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:07:45,861 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:07:45,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:45 BoogieIcfgContainer [2024-10-14 20:07:45,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:07:45,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:07:45,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:07:45,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:07:45,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:07:44" (1/3) ... [2024-10-14 20:07:45,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a3354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:45, skipping insertion in model container [2024-10-14 20:07:45,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:07:45" (2/3) ... [2024-10-14 20:07:45,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a3354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:07:45, skipping insertion in model container [2024-10-14 20:07:45,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:07:45" (3/3) ... [2024-10-14 20:07:45,871 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2.c.cil.c [2024-10-14 20:07:45,887 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:07:45,888 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-10-14 20:07:45,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:07:45,954 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;@44016684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:07:45,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-14 20:07:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 84 states have (on average 1.7023809523809523) internal successors, (143), 109 states have internal predecessors, (143), 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-14 20:07:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:07:45,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:45,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:45,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2039126722, now seen corresponding path program 1 times [2024-10-14 20:07:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920111395] [2024-10-14 20:07:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,185 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-14 20:07:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920111395] [2024-10-14 20:07:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920111395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077173854] [2024-10-14 20:07:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:46,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:46,216 INFO L87 Difference]: Start difference. First operand has 116 states, 84 states have (on average 1.7023809523809523) internal successors, (143), 109 states have internal predecessors, (143), 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-14 20:07:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,347 INFO L93 Difference]: Finished difference Result 283 states and 397 transitions. [2024-10-14 20:07:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:46,350 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-14 20:07:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,357 INFO L225 Difference]: With dead ends: 283 [2024-10-14 20:07:46,357 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 20:07:46,360 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-14 20:07:46,363 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 87 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 363 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-14 20:07:46,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 363 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 20:07:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2024-10-14 20:07:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 135 states have internal predecessors, (175), 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-14 20:07:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2024-10-14 20:07:46,401 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 8 [2024-10-14 20:07:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2024-10-14 20:07:46,401 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-14 20:07:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2024-10-14 20:07:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:07:46,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:07:46,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 89307774, now seen corresponding path program 1 times [2024-10-14 20:07:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362426253] [2024-10-14 20:07:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,463 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-14 20:07:46,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362426253] [2024-10-14 20:07:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362426253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277245114] [2024-10-14 20:07:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:46,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:46,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:46,469 INFO L87 Difference]: Start difference. First operand 142 states and 183 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-14 20:07:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,539 INFO L93 Difference]: Finished difference Result 294 states and 386 transitions. [2024-10-14 20:07:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:46,540 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-14 20:07:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,541 INFO L225 Difference]: With dead ends: 294 [2024-10-14 20:07:46,541 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 20:07:46,545 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-14 20:07:46,546 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:46,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 203 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 20:07:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2024-10-14 20:07:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.4916666666666667) internal successors, (179), 139 states have internal predecessors, (179), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2024-10-14 20:07:46,563 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 13 [2024-10-14 20:07:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,563 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2024-10-14 20:07:46,563 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-14 20:07:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2024-10-14 20:07:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 20:07:46,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:07:46,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 89196428, now seen corresponding path program 1 times [2024-10-14 20:07:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093909801] [2024-10-14 20:07:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,602 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-14 20:07:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093909801] [2024-10-14 20:07:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093909801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:46,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871803000] [2024-10-14 20:07:46,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:46,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:46,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:46,605 INFO L87 Difference]: Start difference. First operand 146 states and 187 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-14 20:07:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,651 INFO L93 Difference]: Finished difference Result 146 states and 187 transitions. [2024-10-14 20:07:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:46,652 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-14 20:07:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,653 INFO L225 Difference]: With dead ends: 146 [2024-10-14 20:07:46,653 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 20:07:46,654 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-14 20:07:46,654 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 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-14 20:07:46,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 20:07:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-10-14 20:07:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 120 states have (on average 1.475) internal successors, (177), 138 states have internal predecessors, (177), 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-14 20:07:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2024-10-14 20:07:46,667 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 13 [2024-10-14 20:07:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,667 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2024-10-14 20:07:46,668 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-14 20:07:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2024-10-14 20:07:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:46,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:07:46,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1149817392, now seen corresponding path program 1 times [2024-10-14 20:07:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160266992] [2024-10-14 20:07:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,777 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-14 20:07:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160266992] [2024-10-14 20:07:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160266992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242133951] [2024-10-14 20:07:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:46,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:46,780 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-14 20:07:46,781 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-14 20:07:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:46,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:46,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:46,881 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-14 20:07:46,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242133951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 20:07:46,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023676440] [2024-10-14 20:07:46,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:46,886 INFO L87 Difference]: Start difference. First operand 145 states and 185 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-14 20:07:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:46,959 INFO L93 Difference]: Finished difference Result 171 states and 225 transitions. [2024-10-14 20:07:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:46,960 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-14 20:07:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:46,961 INFO L225 Difference]: With dead ends: 171 [2024-10-14 20:07:46,961 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 20:07:46,962 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-14 20:07:46,963 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 283 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-14 20:07:46,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 283 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 20:07:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2024-10-14 20:07:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.4488188976377954) internal successors, (184), 145 states have internal predecessors, (184), 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-14 20:07:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2024-10-14 20:07:46,982 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 14 [2024-10-14 20:07:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2024-10-14 20:07:46,982 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-14 20:07:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2024-10-14 20:07:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:07:46,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:46,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:46,998 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-14 20:07:47,188 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-14 20:07:47,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1529877971, now seen corresponding path program 1 times [2024-10-14 20:07:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312156443] [2024-10-14 20:07:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:47,260 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-14 20:07:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312156443] [2024-10-14 20:07:47,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312156443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:47,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328382030] [2024-10-14 20:07:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:47,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:47,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:47,262 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-14 20:07:47,264 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-14 20:07:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:47,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:47,312 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-14 20:07:47,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328382030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:47,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:47,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-14 20:07:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891781718] [2024-10-14 20:07:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:47,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:07:47,314 INFO L87 Difference]: Start difference. First operand 152 states and 192 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-14 20:07:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:47,364 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-10-14 20:07:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:47,365 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-14 20:07:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:47,365 INFO L225 Difference]: With dead ends: 158 [2024-10-14 20:07:47,365 INFO L226 Difference]: Without dead ends: 157 [2024-10-14 20:07:47,366 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-14 20:07:47,366 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 17 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 187 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:47,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 187 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-14 20:07:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-10-14 20:07:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.441860465116279) internal successors, (186), 147 states have internal predecessors, (186), 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-14 20:07:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2024-10-14 20:07:47,380 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 14 [2024-10-14 20:07:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2024-10-14 20:07:47,380 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-14 20:07:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2024-10-14 20:07:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:47,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:47,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:47,395 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-14 20:07:47,581 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-14 20:07:47,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:47,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:47,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1284600877, now seen corresponding path program 1 times [2024-10-14 20:07:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456327986] [2024-10-14 20:07:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:47,617 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-14 20:07:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456327986] [2024-10-14 20:07:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456327986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:07:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999644684] [2024-10-14 20:07:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:47,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:47,619 INFO L87 Difference]: Start difference. First operand 154 states and 194 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-14 20:07:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:47,652 INFO L93 Difference]: Finished difference Result 154 states and 194 transitions. [2024-10-14 20:07:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:47,653 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-14 20:07:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:47,654 INFO L225 Difference]: With dead ends: 154 [2024-10-14 20:07:47,654 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 20:07:47,654 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-14 20:07:47,656 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 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-14 20:07:47,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 20:07:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-14 20:07:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 144 states have internal predecessors, (182), 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-14 20:07:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 190 transitions. [2024-10-14 20:07:47,672 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 190 transitions. Word has length 15 [2024-10-14 20:07:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:47,672 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 190 transitions. [2024-10-14 20:07:47,672 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-14 20:07:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 190 transitions. [2024-10-14 20:07:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:47,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:47,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:47,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:07:47,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:47,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash 546638012, now seen corresponding path program 1 times [2024-10-14 20:07:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:47,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931693571] [2024-10-14 20:07:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:47,699 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-14 20:07:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931693571] [2024-10-14 20:07:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931693571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881702772] [2024-10-14 20:07:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:07:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:07:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:07:47,701 INFO L87 Difference]: Start difference. First operand 151 states and 190 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-14 20:07:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:47,739 INFO L93 Difference]: Finished difference Result 308 states and 393 transitions. [2024-10-14 20:07:47,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:07:47,739 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-14 20:07:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:47,740 INFO L225 Difference]: With dead ends: 308 [2024-10-14 20:07:47,740 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 20:07:47,741 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-14 20:07:47,741 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 201 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-14 20:07:47,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 201 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 20:07:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-14 20:07:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 146 states have internal predecessors, (182), 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-14 20:07:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2024-10-14 20:07:47,756 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 15 [2024-10-14 20:07:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:47,756 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2024-10-14 20:07:47,756 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-14 20:07:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2024-10-14 20:07:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:07:47,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:47,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:47,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:07:47,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:47,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -72875387, now seen corresponding path program 1 times [2024-10-14 20:07:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:47,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160046226] [2024-10-14 20:07:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:47,814 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-14 20:07:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160046226] [2024-10-14 20:07:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160046226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:47,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818243690] [2024-10-14 20:07:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:47,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:47,834 INFO L87 Difference]: Start difference. First operand 153 states and 190 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-14 20:07:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:47,996 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2024-10-14 20:07:47,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:47,997 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-14 20:07:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:47,998 INFO L225 Difference]: With dead ends: 172 [2024-10-14 20:07:47,998 INFO L226 Difference]: Without dead ends: 170 [2024-10-14 20:07:47,999 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-14 20:07:47,999 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 362 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-14 20:07:47,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 362 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-14 20:07:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2024-10-14 20:07:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 153 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 20:07:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 199 transitions. [2024-10-14 20:07:48,008 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 199 transitions. Word has length 15 [2024-10-14 20:07:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,010 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 199 transitions. [2024-10-14 20:07:48,011 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-14 20:07:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 199 transitions. [2024-10-14 20:07:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:48,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,011 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:48,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:07:48,012 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1170084444, now seen corresponding path program 1 times [2024-10-14 20:07:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683624616] [2024-10-14 20:07:48,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,056 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-14 20:07:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683624616] [2024-10-14 20:07:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683624616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529919168] [2024-10-14 20:07:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:48,059 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-14 20:07:48,061 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-14 20:07:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 20:07:48,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:48,122 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-14 20:07:48,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:07:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529919168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:07:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 20:07:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531817935] [2024-10-14 20:07:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:07:48,125 INFO L87 Difference]: Start difference. First operand 160 states and 199 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-14 20:07:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:48,182 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2024-10-14 20:07:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:48,182 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-14 20:07:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:48,183 INFO L225 Difference]: With dead ends: 168 [2024-10-14 20:07:48,183 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 20:07:48,183 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-14 20:07:48,184 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:48,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 288 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 20:07:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-14 20:07:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 157 states have internal predecessors, (194), 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-14 20:07:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2024-10-14 20:07:48,190 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 16 [2024-10-14 20:07:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,191 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2024-10-14 20:07:48,191 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-14 20:07:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2024-10-14 20:07:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:07:48,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:48,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:07:48,395 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-14 20:07:48,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1417355705, now seen corresponding path program 1 times [2024-10-14 20:07:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298522163] [2024-10-14 20:07:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,459 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-14 20:07:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298522163] [2024-10-14 20:07:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298522163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999861895] [2024-10-14 20:07:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:48,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:48,461 INFO L87 Difference]: Start difference. First operand 164 states and 202 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-14 20:07:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:48,505 INFO L93 Difference]: Finished difference Result 330 states and 406 transitions. [2024-10-14 20:07:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:48,506 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-14 20:07:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:48,507 INFO L225 Difference]: With dead ends: 330 [2024-10-14 20:07:48,507 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 20:07:48,508 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-14 20:07:48,509 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 305 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-14 20:07:48,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 305 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 20:07:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-14 20:07:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 160 states have internal predecessors, (197), 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-14 20:07:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2024-10-14 20:07:48,517 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 16 [2024-10-14 20:07:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,519 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2024-10-14 20:07:48,519 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-14 20:07:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2024-10-14 20:07:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:48,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,520 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:48,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:07:48,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1239598417, now seen corresponding path program 1 times [2024-10-14 20:07:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584060266] [2024-10-14 20:07:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,575 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-14 20:07:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584060266] [2024-10-14 20:07:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584060266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917587540] [2024-10-14 20:07:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:48,579 INFO L87 Difference]: Start difference. First operand 168 states and 205 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-14 20:07:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:48,678 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2024-10-14 20:07:48,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:48,679 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-14 20:07:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:48,680 INFO L225 Difference]: With dead ends: 228 [2024-10-14 20:07:48,680 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 20:07:48,680 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-14 20:07:48,681 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 136 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 287 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-14 20:07:48,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 287 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 20:07:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2024-10-14 20:07:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 189 states have (on average 1.3544973544973544) internal successors, (256), 205 states have internal predecessors, (256), 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-14 20:07:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 264 transitions. [2024-10-14 20:07:48,691 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 264 transitions. Word has length 21 [2024-10-14 20:07:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,692 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 264 transitions. [2024-10-14 20:07:48,692 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-14 20:07:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 264 transitions. [2024-10-14 20:07:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 20:07:48,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,693 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:07:48,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 20:07:48,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1268225773, now seen corresponding path program 1 times [2024-10-14 20:07:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367638101] [2024-10-14 20:07:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,731 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-14 20:07:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367638101] [2024-10-14 20:07:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367638101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:48,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338036408] [2024-10-14 20:07:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:48,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:48,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:48,733 INFO L87 Difference]: Start difference. First operand 214 states and 264 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-14 20:07:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:48,815 INFO L93 Difference]: Finished difference Result 226 states and 274 transitions. [2024-10-14 20:07:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:48,815 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-14 20:07:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:48,816 INFO L225 Difference]: With dead ends: 226 [2024-10-14 20:07:48,817 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 20:07:48,817 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-14 20:07:48,817 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 138 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 290 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-14 20:07:48,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 290 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 20:07:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2024-10-14 20:07:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.35) internal successors, (243), 196 states have internal predecessors, (243), 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-14 20:07:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 251 transitions. [2024-10-14 20:07:48,826 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 251 transitions. Word has length 21 [2024-10-14 20:07:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,826 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 251 transitions. [2024-10-14 20:07:48,827 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-14 20:07:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 251 transitions. [2024-10-14 20:07:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:07:48,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,827 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-14 20:07:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:07:48,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1360483978, now seen corresponding path program 1 times [2024-10-14 20:07:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487806602] [2024-10-14 20:07:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,867 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-14 20:07:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487806602] [2024-10-14 20:07:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487806602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219374434] [2024-10-14 20:07:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:48,869 INFO L87 Difference]: Start difference. First operand 205 states and 251 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-14 20:07:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:48,915 INFO L93 Difference]: Finished difference Result 360 states and 440 transitions. [2024-10-14 20:07:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:48,915 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-14 20:07:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:48,916 INFO L225 Difference]: With dead ends: 360 [2024-10-14 20:07:48,916 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 20:07:48,917 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-14 20:07:48,917 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 36 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 301 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-14 20:07:48,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 301 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 20:07:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-10-14 20:07:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 170 states have internal predecessors, (210), 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-14 20:07:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2024-10-14 20:07:48,924 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 22 [2024-10-14 20:07:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:48,925 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2024-10-14 20:07:48,925 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-14 20:07:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2024-10-14 20:07:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 20:07:48,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:48,925 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-14 20:07:48,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 20:07:48,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1978958687, now seen corresponding path program 1 times [2024-10-14 20:07:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161274280] [2024-10-14 20:07:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:48,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:48,964 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-14 20:07:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161274280] [2024-10-14 20:07:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161274280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076209773] [2024-10-14 20:07:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:48,966 INFO L87 Difference]: Start difference. First operand 179 states and 218 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-14 20:07:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:49,044 INFO L93 Difference]: Finished difference Result 347 states and 424 transitions. [2024-10-14 20:07:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:07:49,050 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-14 20:07:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:49,051 INFO L225 Difference]: With dead ends: 347 [2024-10-14 20:07:49,051 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 20:07:49,051 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-14 20:07:49,052 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 70 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 291 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:49,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 291 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 20:07:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-10-14 20:07:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3493975903614457) internal successors, (224), 182 states have internal predecessors, (224), 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-14 20:07:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-14 20:07:49,060 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 22 [2024-10-14 20:07:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:49,060 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-14 20:07:49,060 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-14 20:07:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-14 20:07:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 20:07:49,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:49,061 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-14 20:07:49,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 20:07:49,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:49,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1635481383, now seen corresponding path program 1 times [2024-10-14 20:07:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811122842] [2024-10-14 20:07:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,096 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-14 20:07:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811122842] [2024-10-14 20:07:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811122842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:49,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:07:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700864916] [2024-10-14 20:07:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:49,098 INFO L87 Difference]: Start difference. First operand 191 states and 232 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-14 20:07:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:49,135 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2024-10-14 20:07:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:07:49,136 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-14 20:07:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:49,137 INFO L225 Difference]: With dead ends: 196 [2024-10-14 20:07:49,137 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 20:07:49,137 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-14 20:07:49,137 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:49,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 188 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 20:07:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2024-10-14 20:07:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 156 states have (on average 1.358974358974359) internal successors, (212), 172 states have internal predecessors, (212), 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-14 20:07:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2024-10-14 20:07:49,148 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 27 [2024-10-14 20:07:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2024-10-14 20:07:49,149 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-14 20:07:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2024-10-14 20:07:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 20:07:49,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:49,151 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-14 20:07:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 20:07:49,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash -400155202, now seen corresponding path program 1 times [2024-10-14 20:07:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972287555] [2024-10-14 20:07:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:07:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,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-14 20:07:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972287555] [2024-10-14 20:07:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972287555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963050059] [2024-10-14 20:07:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:49,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:49,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:49,275 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-14 20:07:49,278 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-14 20:07:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:49,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:07:49,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:49,380 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-14 20:07:49,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:49,523 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-14 20:07:49,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963050059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:49,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:49,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-14 20:07:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950576704] [2024-10-14 20:07:49,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:49,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 20:07:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 20:07:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:07:49,524 INFO L87 Difference]: Start difference. First operand 181 states and 220 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-14 20:07:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:49,799 INFO L93 Difference]: Finished difference Result 635 states and 809 transitions. [2024-10-14 20:07:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:07:49,800 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-14 20:07:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:49,802 INFO L225 Difference]: With dead ends: 635 [2024-10-14 20:07:49,802 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 20:07:49,803 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-14 20:07:49,803 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 244 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:49,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 502 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:07:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 20:07:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2024-10-14 20:07:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 192 states have internal predecessors, (236), 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-14 20:07:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 244 transitions. [2024-10-14 20:07:49,818 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 244 transitions. Word has length 40 [2024-10-14 20:07:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:49,818 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 244 transitions. [2024-10-14 20:07:49,819 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-14 20:07:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 244 transitions. [2024-10-14 20:07:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:07:49,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:49,819 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-14 20:07:49,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:07:50,020 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-14 20:07:50,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 602829493, now seen corresponding path program 1 times [2024-10-14 20:07:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35929580] [2024-10-14 20:07:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 20:07:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,097 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-14 20:07:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35929580] [2024-10-14 20:07:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35929580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:50,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:50,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438135476] [2024-10-14 20:07:50,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:50,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:50,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:50,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:50,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:50,100 INFO L87 Difference]: Start difference. First operand 201 states and 244 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-14 20:07:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:50,199 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-10-14 20:07:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:50,200 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-14 20:07:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:50,201 INFO L225 Difference]: With dead ends: 204 [2024-10-14 20:07:50,201 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 20:07:50,201 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-14 20:07:50,202 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 309 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-14 20:07:50,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 309 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 20:07:50,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-14 20:07:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 182 states have internal predecessors, (224), 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-14 20:07:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 232 transitions. [2024-10-14 20:07:50,212 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 232 transitions. Word has length 43 [2024-10-14 20:07:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:50,213 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 232 transitions. [2024-10-14 20:07:50,213 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-14 20:07:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 232 transitions. [2024-10-14 20:07:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 20:07:50,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:50,213 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-14 20:07:50,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 20:07:50,214 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash 574202137, now seen corresponding path program 1 times [2024-10-14 20:07:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248373701] [2024-10-14 20:07:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 20:07:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,267 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-14 20:07:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:50,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248373701] [2024-10-14 20:07:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248373701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011510630] [2024-10-14 20:07:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:50,269 INFO L87 Difference]: Start difference. First operand 191 states and 232 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-14 20:07:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:50,352 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2024-10-14 20:07:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:50,353 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-14 20:07:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:50,354 INFO L225 Difference]: With dead ends: 198 [2024-10-14 20:07:50,354 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 20:07:50,354 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-14 20:07:50,354 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 304 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-14 20:07:50,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 304 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 20:07:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 180. [2024-10-14 20:07:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 160 states have (on average 1.325) internal successors, (212), 171 states have internal predecessors, (212), 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-14 20:07:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2024-10-14 20:07:50,364 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 43 [2024-10-14 20:07:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:50,365 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2024-10-14 20:07:50,365 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-14 20:07:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2024-10-14 20:07:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:07:50,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:50,366 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-14 20:07:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 20:07:50,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:50,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:50,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1653078402, now seen corresponding path program 1 times [2024-10-14 20:07:50,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:50,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866623149] [2024-10-14 20:07:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,439 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-14 20:07:50,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:50,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866623149] [2024-10-14 20:07:50,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866623149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:50,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:50,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:07:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589616656] [2024-10-14 20:07:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:50,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:07:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:07:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:07:50,441 INFO L87 Difference]: Start difference. First operand 180 states and 220 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-14 20:07:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:50,502 INFO L93 Difference]: Finished difference Result 334 states and 410 transitions. [2024-10-14 20:07:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:07:50,502 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-14 20:07:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:50,503 INFO L225 Difference]: With dead ends: 334 [2024-10-14 20:07:50,503 INFO L226 Difference]: Without dead ends: 200 [2024-10-14 20:07:50,504 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-14 20:07:50,504 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 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-14 20:07:50,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:07:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-14 20:07:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2024-10-14 20:07:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.314102564102564) internal successors, (205), 167 states have internal predecessors, (205), 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-14 20:07:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2024-10-14 20:07:50,515 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 44 [2024-10-14 20:07:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2024-10-14 20:07:50,516 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-14 20:07:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2024-10-14 20:07:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:07:50,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:50,516 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-14 20:07:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 20:07:50,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -651337579, now seen corresponding path program 1 times [2024-10-14 20:07:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918900082] [2024-10-14 20:07:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,641 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-14 20:07:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918900082] [2024-10-14 20:07:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918900082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:07:50,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:07:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:07:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531055069] [2024-10-14 20:07:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:07:50,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:07:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:07:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:07:50,643 INFO L87 Difference]: Start difference. First operand 176 states and 213 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-14 20:07:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:50,755 INFO L93 Difference]: Finished difference Result 382 states and 462 transitions. [2024-10-14 20:07:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:07:50,756 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-14 20:07:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:50,757 INFO L225 Difference]: With dead ends: 382 [2024-10-14 20:07:50,757 INFO L226 Difference]: Without dead ends: 249 [2024-10-14 20:07:50,757 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-14 20:07:50,757 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 52 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:50,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 248 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:07:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-14 20:07:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 176. [2024-10-14 20:07:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 167 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-14 20:07:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2024-10-14 20:07:50,770 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 45 [2024-10-14 20:07:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:50,770 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2024-10-14 20:07:50,771 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-14 20:07:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2024-10-14 20:07:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 20:07:50,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:50,771 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-14 20:07:50,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 20:07:50,772 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:50,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1296258099, now seen corresponding path program 1 times [2024-10-14 20:07:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355796727] [2024-10-14 20:07:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:50,950 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-14 20:07:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355796727] [2024-10-14 20:07:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355796727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266294130] [2024-10-14 20:07:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:50,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:50,952 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-14 20:07:50,955 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-14 20:07:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:51,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 20:07:51,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:51,233 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-14 20:07:51,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:51,593 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-14 20:07:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266294130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:51,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-10-14 20:07:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038167119] [2024-10-14 20:07:51,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:51,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 20:07:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 20:07:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:07:51,595 INFO L87 Difference]: Start difference. First operand 176 states and 212 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-14 20:07:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:52,206 INFO L93 Difference]: Finished difference Result 484 states and 584 transitions. [2024-10-14 20:07:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 20:07:52,207 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-14 20:07:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:52,208 INFO L225 Difference]: With dead ends: 484 [2024-10-14 20:07:52,208 INFO L226 Difference]: Without dead ends: 336 [2024-10-14 20:07:52,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-10-14 20:07:52,210 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:52,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 780 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:07:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-14 20:07:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 176. [2024-10-14 20:07:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.2820512820512822) internal successors, (200), 167 states have internal predecessors, (200), 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-14 20:07:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 208 transitions. [2024-10-14 20:07:52,227 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 208 transitions. Word has length 50 [2024-10-14 20:07:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:52,227 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 208 transitions. [2024-10-14 20:07:52,227 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-14 20:07:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 208 transitions. [2024-10-14 20:07:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 20:07:52,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:52,228 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-14 20:07:52,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:07:52,428 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-14 20:07:52,429 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1454208409, now seen corresponding path program 1 times [2024-10-14 20:07:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19890006] [2024-10-14 20:07:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:52,590 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-14 20:07:52,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19890006] [2024-10-14 20:07:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19890006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037644029] [2024-10-14 20:07:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:52,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:52,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:52,593 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-14 20:07:52,594 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-14 20:07:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:52,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 20:07:52,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:52,745 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-14 20:07:52,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:52,989 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-14 20:07:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037644029] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:52,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-14 20:07:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556443527] [2024-10-14 20:07:52,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:52,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 20:07:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 20:07:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-10-14 20:07:52,991 INFO L87 Difference]: Start difference. First operand 176 states and 208 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-14 20:07:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:07:53,419 INFO L93 Difference]: Finished difference Result 952 states and 1190 transitions. [2024-10-14 20:07:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 20:07:53,420 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-14 20:07:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:07:53,423 INFO L225 Difference]: With dead ends: 952 [2024-10-14 20:07:53,423 INFO L226 Difference]: Without dead ends: 830 [2024-10-14 20:07:53,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-10-14 20:07:53,424 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 421 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:07:53,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 798 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:07:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-10-14 20:07:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 216. [2024-10-14 20:07:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.2653061224489797) internal successors, (248), 207 states have internal predecessors, (248), 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-14 20:07:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2024-10-14 20:07:53,443 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 61 [2024-10-14 20:07:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:07:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2024-10-14 20:07:53,444 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-14 20:07:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2024-10-14 20:07:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 20:07:53,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:07:53,444 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-14 20:07:53,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:07:53,648 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-14 20:07:53,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:07:53,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:07:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash -223107635, now seen corresponding path program 2 times [2024-10-14 20:07:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:07:53,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302448554] [2024-10-14 20:07:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:07:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:07:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:07:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:07:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:07:53,979 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-14 20:07:53,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:07:53,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302448554] [2024-10-14 20:07:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302448554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:07:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738184365] [2024-10-14 20:07:53,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:07:53,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:07:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:07:53,982 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-14 20:07:53,983 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-14 20:07:54,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:07:54,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:07:54,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 20:07:54,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:07:55,111 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-14 20:07:55,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:07:56,682 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-14 20:07:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738184365] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:07:56,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:07:56,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-10-14 20:07:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73820937] [2024-10-14 20:07:56,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:07:56,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-14 20:07:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:07:56,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-14 20:07:56,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 20:07:56,685 INFO L87 Difference]: Start difference. First operand 216 states and 256 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-14 20:08:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:01,711 INFO L93 Difference]: Finished difference Result 674 states and 810 transitions. [2024-10-14 20:08:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 20:08:01,712 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-14 20:08:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:01,714 INFO L225 Difference]: With dead ends: 674 [2024-10-14 20:08:01,714 INFO L226 Difference]: Without dead ends: 524 [2024-10-14 20:08:01,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 20:08:01,716 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 390 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:01,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1439 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 20:08:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-14 20:08:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 216. [2024-10-14 20:08:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 207 states have internal predecessors, (240), 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-14 20:08:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 248 transitions. [2024-10-14 20:08:01,747 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 248 transitions. Word has length 70 [2024-10-14 20:08:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:01,747 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 248 transitions. [2024-10-14 20:08:01,747 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-14 20:08:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 248 transitions. [2024-10-14 20:08:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 20:08:01,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:01,751 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-14 20:08:01,763 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-14 20:08:01,955 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-14 20:08:01,956 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2082472345, now seen corresponding path program 2 times [2024-10-14 20:08:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:01,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811881087] [2024-10-14 20:08:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:02,345 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-14 20:08:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811881087] [2024-10-14 20:08:02,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811881087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159606643] [2024-10-14 20:08:02,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:08:02,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:02,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:02,347 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-14 20:08:02,348 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-14 20:08:02,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:08:02,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:08:02,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 20:08:02,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:02,596 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-14 20:08:02,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:03,162 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-14 20:08:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159606643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:03,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-10-14 20:08:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015900283] [2024-10-14 20:08:03,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:03,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 20:08:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 20:08:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 20:08:03,165 INFO L87 Difference]: Start difference. First operand 216 states and 248 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-14 20:08:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:08:03,849 INFO L93 Difference]: Finished difference Result 1672 states and 2102 transitions. [2024-10-14 20:08:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 20:08:03,849 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-14 20:08:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:08:03,853 INFO L225 Difference]: With dead ends: 1672 [2024-10-14 20:08:03,853 INFO L226 Difference]: Without dead ends: 1550 [2024-10-14 20:08:03,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 20:08:03,855 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1389 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:08:03,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 746 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:08:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-10-14 20:08:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 296. [2024-10-14 20:08:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 276 states have (on average 1.2173913043478262) internal successors, (336), 287 states have internal predecessors, (336), 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-14 20:08:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 344 transitions. [2024-10-14 20:08:03,894 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 344 transitions. Word has length 101 [2024-10-14 20:08:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:08:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 344 transitions. [2024-10-14 20:08:03,894 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-14 20:08:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 344 transitions. [2024-10-14 20:08:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 20:08:03,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:08:03,895 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-14 20:08:03,908 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-14 20:08:04,095 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-14 20:08:04,096 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-10-14 20:08:04,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:08:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -144795187, now seen corresponding path program 3 times [2024-10-14 20:08:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:08:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594910813] [2024-10-14 20:08:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:08:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:08:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:08:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:04,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 20:08:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:08:04,808 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-14 20:08:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:08:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594910813] [2024-10-14 20:08:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594910813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:08:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511676695] [2024-10-14 20:08:04,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:08:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:08:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:08:04,811 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-14 20:08:04,812 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-14 20:08:05,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-10-14 20:08:05,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:08:05,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-14 20:08:05,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:08:08,457 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-14 20:08:08,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:08:17,191 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-14 20:08:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511676695] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:08:17,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:08:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-10-14 20:08:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214187419] [2024-10-14 20:08:17,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:08:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-10-14 20:08:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:08:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-10-14 20:08:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-10-14 20:08:17,195 INFO L87 Difference]: Start difference. First operand 296 states and 344 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) [2024-10-14 20:09:06,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []