./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d 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_4-3a.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:55:53,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:55:53,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 12:55:53,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:55:53,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:55:53,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:55:53,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:55:53,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:55:53,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:55:53,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:55:53,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:55:53,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:55:53,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:55:53,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:55:53,221 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:55:53,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:55:53,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 12:55:53,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:55:53,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:55:53,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:55:53,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:55:53,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 12:55:53,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:55:53,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 12:55:53,229 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:55:53,229 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 12:55:53,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:55:53,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:55:53,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 12:55:53,230 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:55:53,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:55:53,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:53,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 12:55:53,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:55:53,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:55:53,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:55:53,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:55:53,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:55:53,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:55:53,233 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-10-13 12:55:53,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:55:53,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:55:53,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:55:53,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:55:53,454 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:55:53,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-13 12:55:54,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:55:54,802 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:55:54,803 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-10-13 12:55:54,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961bac2fd/f3b6cd92e94849bd8463e6f4a772dd0e/FLAG0b577aaa9 [2024-10-13 12:55:54,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961bac2fd/f3b6cd92e94849bd8463e6f4a772dd0e [2024-10-13 12:55:54,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:55:54,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:55:54,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:54,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:55:54,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:55:54,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:54" (1/1) ... [2024-10-13 12:55:54,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c772bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:54, skipping insertion in model container [2024-10-13 12:55:54,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:55:54" (1/1) ... [2024-10-13 12:55:54,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:55:55,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:55,039 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:55:55,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:55:55,077 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:55:55,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55 WrapperNode [2024-10-13 12:55:55,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:55:55,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:55,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:55:55,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:55:55,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,104 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-10-13 12:55:55,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:55:55,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:55:55,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:55:55,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:55:55,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,128 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-13 12:55:55,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:55:55,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:55:55,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:55:55,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:55:55,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (1/1) ... [2024-10-13 12:55:55,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:55:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:55,170 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-13 12:55:55,171 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-13 12:55:55,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:55:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:55:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-13 12:55:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-13 12:55:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:55:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:55:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-13 12:55:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-13 12:55:55,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:55:55,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:55:55,273 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:55:55,275 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:55:55,548 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-13 12:55:55,548 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:55:55,571 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:55:55,572 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:55:55,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:55 BoogieIcfgContainer [2024-10-13 12:55:55,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:55:55,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:55:55,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:55:55,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:55:55,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:55:54" (1/3) ... [2024-10-13 12:55:55,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c691ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:55, skipping insertion in model container [2024-10-13 12:55:55,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:55:55" (2/3) ... [2024-10-13 12:55:55,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c691ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:55:55, skipping insertion in model container [2024-10-13 12:55:55,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:55" (3/3) ... [2024-10-13 12:55:55,581 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-10-13 12:55:55,593 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:55:55,593 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-13 12:55:55,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:55:55,647 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;@5d5dd992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:55:55,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-13 12:55:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 73 states have (on average 1.643835616438356) internal successors, (120), 89 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 12:55:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 12:55:55,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:55,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:55,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:55,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:55,665 INFO L85 PathProgramCache]: Analyzing trace with hash 374723516, now seen corresponding path program 1 times [2024-10-13 12:55:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:55,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077301728] [2024-10-13 12:55:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:55,847 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-13 12:55:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077301728] [2024-10-13 12:55:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077301728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:55,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352722829] [2024-10-13 12:55:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:55,869 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.643835616438356) internal successors, (120), 89 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:55,984 INFO L93 Difference]: Finished difference Result 249 states and 363 transitions. [2024-10-13 12:55:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:55,987 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-13 12:55:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,009 INFO L225 Difference]: With dead ends: 249 [2024-10-13 12:55:56,011 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 12:55:56,015 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-13 12:55:56,022 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 82 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 327 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 12:55:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2024-10-13 12:55:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 121 states have internal predecessors, (163), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2024-10-13 12:55:56,077 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 8 [2024-10-13 12:55:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,077 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2024-10-13 12:55:56,077 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-13 12:55:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2024-10-13 12:55:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:56,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,079 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:55:56,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2141003497, now seen corresponding path program 1 times [2024-10-13 12:55:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872308158] [2024-10-13 12:55:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:55:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872308158] [2024-10-13 12:55:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872308158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:56,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:55:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076409857] [2024-10-13 12:55:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:56,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:56,144 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:56,187 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2024-10-13 12:55:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:56,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-13 12:55:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,188 INFO L225 Difference]: With dead ends: 133 [2024-10-13 12:55:56,189 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 12:55:56,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:56,190 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 202 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 12:55:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-13 12:55:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 120 states have internal predecessors, (161), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-10-13 12:55:56,203 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 14 [2024-10-13 12:55:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,204 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-10-13 12:55:56,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-10-13 12:55:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:55:56,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:55:56,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash -379187772, now seen corresponding path program 1 times [2024-10-13 12:55:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008452306] [2024-10-13 12:55:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,260 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-13 12:55:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008452306] [2024-10-13 12:55:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008452306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:56,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353615773] [2024-10-13 12:55:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:55:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:55:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:55:56,265 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:56,311 INFO L93 Difference]: Finished difference Result 246 states and 328 transitions. [2024-10-13 12:55:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:55:56,311 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-13 12:55:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,312 INFO L225 Difference]: With dead ends: 246 [2024-10-13 12:55:56,312 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 12:55:56,313 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-13 12:55:56,314 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 199 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 12:55:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2024-10-13 12:55:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 124 states have internal predecessors, (165), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 180 transitions. [2024-10-13 12:55:56,331 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 180 transitions. Word has length 13 [2024-10-13 12:55:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 180 transitions. [2024-10-13 12:55:56,331 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-13 12:55:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 180 transitions. [2024-10-13 12:55:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:56,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,332 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:55:56,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1975226380, now seen corresponding path program 1 times [2024-10-13 12:55:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464539823] [2024-10-13 12:55:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,403 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-13 12:55:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464539823] [2024-10-13 12:55:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464539823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:56,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251880132] [2024-10-13 12:55:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:56,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:56,405 INFO L87 Difference]: Start difference. First operand 136 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:56,481 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2024-10-13 12:55:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-13 12:55:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,483 INFO L225 Difference]: With dead ends: 193 [2024-10-13 12:55:56,484 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 12:55:56,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:56,485 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 378 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 12:55:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2024-10-13 12:55:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 149 states have (on average 1.4563758389261745) internal successors, (217), 160 states have internal predecessors, (217), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2024-10-13 12:55:56,495 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 15 [2024-10-13 12:55:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,496 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2024-10-13 12:55:56,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2024-10-13 12:55:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:55:56,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,497 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:55:56,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1946599024, now seen corresponding path program 1 times [2024-10-13 12:55:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936498106] [2024-10-13 12:55:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,545 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-13 12:55:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936498106] [2024-10-13 12:55:56,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936498106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:56,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710362145] [2024-10-13 12:55:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:56,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:56,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:56,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:56,551 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:56,631 INFO L93 Difference]: Finished difference Result 194 states and 257 transitions. [2024-10-13 12:55:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-13 12:55:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,634 INFO L225 Difference]: With dead ends: 194 [2024-10-13 12:55:56,635 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 12:55:56,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:55:56,636 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 76 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 373 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 12:55:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2024-10-13 12:55:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.423841059602649) internal successors, (215), 161 states have internal predecessors, (215), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2024-10-13 12:55:56,657 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 15 [2024-10-13 12:55:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,658 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2024-10-13 12:55:56,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2024-10-13 12:55:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 12:55:56,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:55:56,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1130135782, now seen corresponding path program 1 times [2024-10-13 12:55:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701409703] [2024-10-13 12:55:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,720 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-13 12:55:56,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701409703] [2024-10-13 12:55:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701409703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:56,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:56,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:56,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263915127] [2024-10-13 12:55:56,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:56,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:56,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:56,725 INFO L87 Difference]: Start difference. First operand 174 states and 230 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:56,823 INFO L93 Difference]: Finished difference Result 327 states and 427 transitions. [2024-10-13 12:55:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 12:55:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:56,835 INFO L225 Difference]: With dead ends: 327 [2024-10-13 12:55:56,836 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 12:55:56,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:56,837 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 123 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:56,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 312 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 12:55:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2024-10-13 12:55:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.4099378881987579) internal successors, (227), 171 states have internal predecessors, (227), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2024-10-13 12:55:56,871 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 14 [2024-10-13 12:55:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:56,894 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2024-10-13 12:55:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2024-10-13 12:55:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 12:55:56,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:56,895 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:55:56,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1431981738, now seen corresponding path program 1 times [2024-10-13 12:55:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924860779] [2024-10-13 12:55:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:56,965 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-13 12:55:56,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924860779] [2024-10-13 12:55:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924860779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:56,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738724936] [2024-10-13 12:55:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:56,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:56,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:56,968 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-13 12:55:56,969 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-13 12:55:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:55:57,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:57,059 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-13 12:55:57,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:57,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738724936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 12:55:57,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014210697] [2024-10-13 12:55:57,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:55:57,062 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:55:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:57,109 INFO L93 Difference]: Finished difference Result 201 states and 269 transitions. [2024-10-13 12:55:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:57,109 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-13 12:55:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:57,110 INFO L225 Difference]: With dead ends: 201 [2024-10-13 12:55:57,110 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 12:55:57,111 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-13 12:55:57,111 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:57,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:57,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 12:55:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2024-10-13 12:55:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 156 states have (on average 1.4102564102564104) internal successors, (220), 166 states have internal predecessors, (220), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-13 12:55:57,120 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 16 [2024-10-13 12:55:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-13 12:55:57,120 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-13 12:55:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-13 12:55:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:55:57,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,124 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,137 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-13 12:55:57,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:57,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:57,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2049761853, now seen corresponding path program 1 times [2024-10-13 12:55:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199394163] [2024-10-13 12:55:57,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,387 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-13 12:55:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199394163] [2024-10-13 12:55:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199394163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:57,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655484848] [2024-10-13 12:55:57,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:57,389 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:55:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:57,466 INFO L93 Difference]: Finished difference Result 204 states and 267 transitions. [2024-10-13 12:55:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:57,466 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-13 12:55:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:57,467 INFO L225 Difference]: With dead ends: 204 [2024-10-13 12:55:57,468 INFO L226 Difference]: Without dead ends: 202 [2024-10-13 12:55:57,468 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-13 12:55:57,468 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 73 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:57,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 373 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-13 12:55:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 183. [2024-10-13 12:55:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 161 states have (on average 1.391304347826087) internal successors, (224), 170 states have internal predecessors, (224), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2024-10-13 12:55:57,479 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 21 [2024-10-13 12:55:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:57,481 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2024-10-13 12:55:57,481 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-13 12:55:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2024-10-13 12:55:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 12:55:57,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,483 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:55:57,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2021134497, now seen corresponding path program 1 times [2024-10-13 12:55:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909877964] [2024-10-13 12:55:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,538 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-13 12:55:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909877964] [2024-10-13 12:55:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909877964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:55:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483385406] [2024-10-13 12:55:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:55:57,540 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:55:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:57,602 INFO L93 Difference]: Finished difference Result 200 states and 261 transitions. [2024-10-13 12:55:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:55:57,603 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-13 12:55:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:57,603 INFO L225 Difference]: With dead ends: 200 [2024-10-13 12:55:57,604 INFO L226 Difference]: Without dead ends: 198 [2024-10-13 12:55:57,604 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-13 12:55:57,604 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 74 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:57,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 369 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-13 12:55:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 176. [2024-10-13 12:55:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 163 states have internal predecessors, (216), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2024-10-13 12:55:57,615 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 21 [2024-10-13 12:55:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:57,616 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2024-10-13 12:55:57,617 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-13 12:55:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2024-10-13 12:55:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 12:55:57,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,617 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:55:57,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 456652371, now seen corresponding path program 1 times [2024-10-13 12:55:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268700661] [2024-10-13 12:55:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 12:55:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268700661] [2024-10-13 12:55:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268700661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:55:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30003255] [2024-10-13 12:55:57,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:55:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:55:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:55:57,656 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:57,701 INFO L93 Difference]: Finished difference Result 196 states and 260 transitions. [2024-10-13 12:55:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:55:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 12:55:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:57,703 INFO L225 Difference]: With dead ends: 196 [2024-10-13 12:55:57,703 INFO L226 Difference]: Without dead ends: 195 [2024-10-13 12:55:57,704 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-13 12:55:57,704 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:57,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 299 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-13 12:55:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 160. [2024-10-13 12:55:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 147 states have internal predecessors, (195), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2024-10-13 12:55:57,713 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 20 [2024-10-13 12:55:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:57,713 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2024-10-13 12:55:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 12:55:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2024-10-13 12:55:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 12:55:57,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:57,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 12:55:57,715 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1399767479, now seen corresponding path program 1 times [2024-10-13 12:55:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:57,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651615900] [2024-10-13 12:55:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 12:55:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651615900] [2024-10-13 12:55:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651615900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781016260] [2024-10-13 12:55:57,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:57,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:57,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:57,882 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-13 12:55:57,883 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-13 12:55:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:57,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:55:57,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:55:57,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:55:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781016260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:55:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-13 12:55:57,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815494263] [2024-10-13 12:55:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:55:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:55:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:57,969 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 12:55:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:58,012 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2024-10-13 12:55:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:55:58,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-10-13 12:55:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:58,013 INFO L225 Difference]: With dead ends: 160 [2024-10-13 12:55:58,014 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 12:55:58,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:55:58,014 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:58,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 12:55:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-13 12:55:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 141 states have (on average 1.375886524822695) internal successors, (194), 146 states have internal predecessors, (194), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 12:55:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2024-10-13 12:55:58,021 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 37 [2024-10-13 12:55:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:58,021 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2024-10-13 12:55:58,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 12:55:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2024-10-13 12:55:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 12:55:58,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:58,022 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:58,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:55:58,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 12:55:58,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 443119100, now seen corresponding path program 1 times [2024-10-13 12:55:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728536056] [2024-10-13 12:55:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 12:55:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728536056] [2024-10-13 12:55:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728536056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827212705] [2024-10-13 12:55:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:58,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:58,353 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-13 12:55:58,354 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-13 12:55:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 12:55:58,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:58,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827212705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:58,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-13 12:55:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662400370] [2024-10-13 12:55:58,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:55:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:55:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-13 12:55:58,517 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 12:55:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:58,619 INFO L93 Difference]: Finished difference Result 228 states and 297 transitions. [2024-10-13 12:55:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:55:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2024-10-13 12:55:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:58,621 INFO L225 Difference]: With dead ends: 228 [2024-10-13 12:55:58,621 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 12:55:58,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-13 12:55:58,622 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 15 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:58,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1188 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 12:55:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2024-10-13 12:55:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.364864864864865) internal successors, (202), 154 states have internal predecessors, (202), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-13 12:55:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2024-10-13 12:55:58,631 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 38 [2024-10-13 12:55:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:58,632 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2024-10-13 12:55:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-13 12:55:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2024-10-13 12:55:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 12:55:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:58,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:58,648 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-13 12:55:58,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:58,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1493287875, now seen corresponding path program 1 times [2024-10-13 12:55:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:58,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110355402] [2024-10-13 12:55:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 12:55:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 12:55:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110355402] [2024-10-13 12:55:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110355402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 12:55:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143678628] [2024-10-13 12:55:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:55:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:55:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:55:59,009 INFO L87 Difference]: Start difference. First operand 170 states and 222 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 12:55:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,094 INFO L93 Difference]: Finished difference Result 274 states and 354 transitions. [2024-10-13 12:55:59,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:55:59,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2024-10-13 12:55:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,096 INFO L225 Difference]: With dead ends: 274 [2024-10-13 12:55:59,096 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 12:55:59,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:55:59,097 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 103 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:59,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 801 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:55:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 12:55:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2024-10-13 12:55:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 183 states have (on average 1.349726775956284) internal successors, (247), 189 states have internal predecessors, (247), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-10-13 12:55:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 280 transitions. [2024-10-13 12:55:59,106 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 280 transitions. Word has length 45 [2024-10-13 12:55:59,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,106 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 280 transitions. [2024-10-13 12:55:59,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 12:55:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 280 transitions. [2024-10-13 12:55:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 12:55:59,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 12:55:59,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:59,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2027857939, now seen corresponding path program 1 times [2024-10-13 12:55:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046359459] [2024-10-13 12:55:59,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:55:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 12:55:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046359459] [2024-10-13 12:55:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046359459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:55:59,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:55:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:55:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843937057] [2024-10-13 12:55:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:55:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:55:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:55:59,236 INFO L87 Difference]: Start difference. First operand 212 states and 280 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:55:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,281 INFO L93 Difference]: Finished difference Result 310 states and 405 transitions. [2024-10-13 12:55:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:55:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-13 12:55:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,283 INFO L225 Difference]: With dead ends: 310 [2024-10-13 12:55:59,283 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 12:55:59,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:55:59,283 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 6 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:59,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 705 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 12:55:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2024-10-13 12:55:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 186 states have (on average 1.3440860215053763) internal successors, (250), 192 states have internal predecessors, (250), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-10-13 12:55:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2024-10-13 12:55:59,292 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 42 [2024-10-13 12:55:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,292 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2024-10-13 12:55:59,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:55:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2024-10-13 12:55:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 12:55:59,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 12:55:59,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1079318013, now seen corresponding path program 1 times [2024-10-13 12:55:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384476993] [2024-10-13 12:55:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 12:55:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 12:55:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 12:55:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:59,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:55:59,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384476993] [2024-10-13 12:55:59,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384476993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:55:59,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787022839] [2024-10-13 12:55:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:55:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:55:59,431 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-13 12:55:59,432 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-13 12:55:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 12:55:59,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:55:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:59,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:55:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:55:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787022839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:55:59,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:55:59,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-13 12:55:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918007682] [2024-10-13 12:55:59,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:55:59,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:55:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:55:59,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:55:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:55:59,594 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-13 12:55:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:55:59,659 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2024-10-13 12:55:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:55:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 45 [2024-10-13 12:55:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:55:59,662 INFO L225 Difference]: With dead ends: 309 [2024-10-13 12:55:59,662 INFO L226 Difference]: Without dead ends: 206 [2024-10-13 12:55:59,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 12:55:59,663 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 8 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:55:59,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1044 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:55:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-13 12:55:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-13 12:55:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 184 states have internal predecessors, (240), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-13 12:55:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 265 transitions. [2024-10-13 12:55:59,673 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 265 transitions. Word has length 45 [2024-10-13 12:55:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:55:59,673 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 265 transitions. [2024-10-13 12:55:59,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-13 12:55:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 265 transitions. [2024-10-13 12:55:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 12:55:59,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:55:59,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:55:59,687 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-13 12:55:59,874 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,SelfDestructingSolverStorable14 [2024-10-13 12:55:59,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:55:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:55:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash -736963938, now seen corresponding path program 2 times [2024-10-13 12:55:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:55:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951298767] [2024-10-13 12:55:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:55:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:55:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:55:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:55:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:55:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 12:56:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 12:56:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951298767] [2024-10-13 12:56:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951298767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646012861] [2024-10-13 12:56:00,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:56:00,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:00,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:00,015 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-13 12:56:00,016 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-13 12:56:00,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:56:00,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:56:00,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:56:00,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 12:56:00,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:56:00,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646012861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:56:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-13 12:56:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455273194] [2024-10-13 12:56:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:56:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:56:00,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:56:00,261 INFO L87 Difference]: Start difference. First operand 204 states and 265 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:56:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,325 INFO L93 Difference]: Finished difference Result 204 states and 265 transitions. [2024-10-13 12:56:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:56:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-10-13 12:56:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,326 INFO L225 Difference]: With dead ends: 204 [2024-10-13 12:56:00,326 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 12:56:00,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:56:00,328 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:00,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 344 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:56:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 12:56:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-10-13 12:56:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 179 states have (on average 1.329608938547486) internal successors, (238), 183 states have internal predecessors, (238), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-13 12:56:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 263 transitions. [2024-10-13 12:56:00,342 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 263 transitions. Word has length 46 [2024-10-13 12:56:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,343 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 263 transitions. [2024-10-13 12:56:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 12:56:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 263 transitions. [2024-10-13 12:56:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 12:56:00,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:00,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:56:00,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 12:56:00,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:00,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1365813185, now seen corresponding path program 1 times [2024-10-13 12:56:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871467913] [2024-10-13 12:56:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 12:56:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 12:56:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-13 12:56:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871467913] [2024-10-13 12:56:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871467913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:00,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:56:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025252034] [2024-10-13 12:56:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:56:00,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:56:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:00,650 INFO L87 Difference]: Start difference. First operand 203 states and 263 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 12:56:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:00,682 INFO L93 Difference]: Finished difference Result 205 states and 265 transitions. [2024-10-13 12:56:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:56:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-10-13 12:56:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:00,684 INFO L225 Difference]: With dead ends: 205 [2024-10-13 12:56:00,684 INFO L226 Difference]: Without dead ends: 203 [2024-10-13 12:56:00,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:00,684 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 21 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:00,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:56:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-13 12:56:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-10-13 12:56:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 179 states have (on average 1.3072625698324023) internal successors, (234), 181 states have internal predecessors, (234), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2024-10-13 12:56:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 259 transitions. [2024-10-13 12:56:00,696 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 259 transitions. Word has length 65 [2024-10-13 12:56:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:00,697 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 259 transitions. [2024-10-13 12:56:00,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 12:56:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 259 transitions. [2024-10-13 12:56:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 12:56:00,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:00,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 12:56:00,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash 609464474, now seen corresponding path program 1 times [2024-10-13 12:56:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232151364] [2024-10-13 12:56:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 12:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 12:56:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 12:56:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232151364] [2024-10-13 12:56:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232151364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544074463] [2024-10-13 12:56:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:00,885 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-13 12:56:00,886 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-13 12:56:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:00,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 12:56:00,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 12:56:00,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:56:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544074463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:01,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:56:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 13 [2024-10-13 12:56:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561810951] [2024-10-13 12:56:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:56:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:56:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:56:01,001 INFO L87 Difference]: Start difference. First operand 201 states and 259 transitions. Second operand has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 12:56:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:01,114 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2024-10-13 12:56:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:56:01,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2024-10-13 12:56:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:01,116 INFO L225 Difference]: With dead ends: 311 [2024-10-13 12:56:01,116 INFO L226 Difference]: Without dead ends: 263 [2024-10-13 12:56:01,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:56:01,116 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:01,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1034 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:56:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-13 12:56:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 210. [2024-10-13 12:56:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 188 states have internal predecessors, (240), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-13 12:56:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 272 transitions. [2024-10-13 12:56:01,132 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 272 transitions. Word has length 66 [2024-10-13 12:56:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:01,132 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 272 transitions. [2024-10-13 12:56:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 12:56:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 272 transitions. [2024-10-13 12:56:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 12:56:01,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:01,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:01,147 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-13 12:56:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 12:56:01,338 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1676202150, now seen corresponding path program 1 times [2024-10-13 12:56:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953229906] [2024-10-13 12:56:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 12:56:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 12:56:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 12:56:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 12:56:01,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953229906] [2024-10-13 12:56:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953229906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:56:01,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754740468] [2024-10-13 12:56:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:56:01,393 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-13 12:56:01,406 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-13 12:56:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:56:01,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:56:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 12:56:01,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:56:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754740468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 12:56:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-13 12:56:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17443284] [2024-10-13 12:56:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:01,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:56:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:56:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:01,469 INFO L87 Difference]: Start difference. First operand 210 states and 272 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:01,503 INFO L93 Difference]: Finished difference Result 400 states and 520 transitions. [2024-10-13 12:56:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:56:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2024-10-13 12:56:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:01,505 INFO L225 Difference]: With dead ends: 400 [2024-10-13 12:56:01,505 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 12:56:01,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:01,506 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:01,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:56:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 12:56:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2024-10-13 12:56:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.291005291005291) internal successors, (244), 193 states have internal predecessors, (244), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-13 12:56:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2024-10-13 12:56:01,519 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 65 [2024-10-13 12:56:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2024-10-13 12:56:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2024-10-13 12:56:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 12:56:01,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:01,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:01,533 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-13 12:56:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:56:01,721 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash 616400951, now seen corresponding path program 1 times [2024-10-13 12:56:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141548524] [2024-10-13 12:56:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 12:56:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:56:01,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141548524] [2024-10-13 12:56:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141548524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:56:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202073861] [2024-10-13 12:56:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:01,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:56:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:56:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:56:01,834 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:01,959 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2024-10-13 12:56:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:56:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-13 12:56:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:01,961 INFO L225 Difference]: With dead ends: 343 [2024-10-13 12:56:01,961 INFO L226 Difference]: Without dead ends: 284 [2024-10-13 12:56:01,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:56:01,961 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 30 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:01,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 592 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 12:56:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-13 12:56:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 241. [2024-10-13 12:56:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 215 states have internal predecessors, (270), 19 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2024-10-13 12:56:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 310 transitions. [2024-10-13 12:56:01,973 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 310 transitions. Word has length 59 [2024-10-13 12:56:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 310 transitions. [2024-10-13 12:56:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 310 transitions. [2024-10-13 12:56:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:56:01,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:01,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:01,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 12:56:01,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:01,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:01,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1979203262, now seen corresponding path program 1 times [2024-10-13 12:56:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:01,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201899566] [2024-10-13 12:56:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 12:56:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 12:56:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201899566] [2024-10-13 12:56:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201899566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:56:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316977718] [2024-10-13 12:56:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:56:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:56:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:02,039 INFO L87 Difference]: Start difference. First operand 241 states and 310 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,070 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2024-10-13 12:56:02,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:56:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-13 12:56:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,072 INFO L225 Difference]: With dead ends: 252 [2024-10-13 12:56:02,072 INFO L226 Difference]: Without dead ends: 246 [2024-10-13 12:56:02,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:56:02,072 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:02,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 156 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:56:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-13 12:56:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2024-10-13 12:56:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 217 states have internal predecessors, (270), 20 states have call successors, (20), 7 states have call predecessors, (20), 9 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-10-13 12:56:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2024-10-13 12:56:02,083 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 60 [2024-10-13 12:56:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,084 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2024-10-13 12:56:02,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 12:56:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2024-10-13 12:56:02,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 12:56:02,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:02,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 12:56:02,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:02,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash -443305329, now seen corresponding path program 1 times [2024-10-13 12:56:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518935770] [2024-10-13 12:56:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 12:56:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 12:56:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 12:56:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 12:56:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 12:56:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518935770] [2024-10-13 12:56:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518935770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:56:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991884992] [2024-10-13 12:56:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:56:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:56:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:56:02,227 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 12:56:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,286 INFO L93 Difference]: Finished difference Result 334 states and 428 transitions. [2024-10-13 12:56:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:56:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2024-10-13 12:56:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,288 INFO L225 Difference]: With dead ends: 334 [2024-10-13 12:56:02,288 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 12:56:02,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:56:02,290 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:02,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 748 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:56:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 12:56:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2024-10-13 12:56:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 218 states have (on average 1.2568807339449541) internal successors, (274), 223 states have internal predecessors, (274), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2024-10-13 12:56:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2024-10-13 12:56:02,304 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 75 [2024-10-13 12:56:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2024-10-13 12:56:02,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-13 12:56:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2024-10-13 12:56:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-13 12:56:02,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:56:02,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:02,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 12:56:02,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2024-10-13 12:56:02,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:56:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 812106054, now seen corresponding path program 1 times [2024-10-13 12:56:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:56:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051295726] [2024-10-13 12:56:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:56:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:56:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 12:56:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 12:56:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 12:56:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 12:56:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 12:56:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 12:56:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:56:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 12:56:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:56:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051295726] [2024-10-13 12:56:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051295726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:56:02,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:56:02,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:56:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888492793] [2024-10-13 12:56:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:56:02,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:56:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:56:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:56:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:02,439 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:56:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:56:02,473 INFO L93 Difference]: Finished difference Result 256 states and 334 transitions. [2024-10-13 12:56:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:56:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2024-10-13 12:56:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:56:02,474 INFO L225 Difference]: With dead ends: 256 [2024-10-13 12:56:02,474 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 12:56:02,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:56:02,475 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:56:02,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 152 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 12:56:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 12:56:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 12:56:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:56:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 12:56:02,476 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2024-10-13 12:56:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:56:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 12:56:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 12:56:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 12:56:02,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-10-13 12:56:02,479 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-10-13 12:56:02,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-10-13 12:56:02,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 12:56:02,482 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:56:02,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 12:56:02,991 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:56:03,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:56:03 BoogieIcfgContainer [2024-10-13 12:56:03,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:56:03,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:56:03,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:56:03,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:56:03,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:55:55" (3/4) ... [2024-10-13 12:56:03,007 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:56:03,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2024-10-13 12:56:03,009 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2024-10-13 12:56:03,010 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-13 12:56:03,013 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2024-10-13 12:56:03,014 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 12:56:03,014 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:56:03,014 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 12:56:03,036 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-10-13 12:56:03,036 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-13 12:56:03,056 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) [2024-10-13 12:56:03,057 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2024-10-13 12:56:03,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:56:03,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:56:03,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:56:03,095 INFO L158 Benchmark]: Toolchain (without parser) took 8272.07ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 119.7MB in the beginning and 108.7MB in the end (delta: 11.0MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,095 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:56:03,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.07ms. Allocated memory is still 188.7MB. Free memory was 119.4MB in the beginning and 104.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.22ms. Allocated memory is still 188.7MB. Free memory was 104.6MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,095 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 188.7MB. Free memory was 102.9MB in the beginning and 100.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,096 INFO L158 Benchmark]: RCFGBuilder took 432.51ms. Allocated memory is still 188.7MB. Free memory was 100.7MB in the beginning and 135.2MB in the end (delta: -34.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,097 INFO L158 Benchmark]: TraceAbstraction took 7430.72ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 134.4MB in the beginning and 115.0MB in the end (delta: 19.5MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,097 INFO L158 Benchmark]: Witness Printer took 89.02ms. Allocated memory is still 285.2MB. Free memory was 115.0MB in the beginning and 108.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 12:56:03,099 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.07ms. Allocated memory is still 188.7MB. Free memory was 119.4MB in the beginning and 104.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.22ms. Allocated memory is still 188.7MB. Free memory was 104.6MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 188.7MB. Free memory was 102.9MB in the beginning and 100.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.51ms. Allocated memory is still 188.7MB. Free memory was 100.7MB in the beginning and 135.2MB in the end (delta: -34.5MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7430.72ms. Allocated memory was 188.7MB in the beginning and 285.2MB in the end (delta: 96.5MB). Free memory was 134.4MB in the beginning and 115.0MB in the end (delta: 19.5MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. * Witness Printer took 89.02ms. Allocated memory is still 285.2MB. Free memory was 115.0MB in the beginning and 108.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 10516 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8158 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1754 IncrementalHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 2358 mSDtfsCounter, 1754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 553 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=22, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 309 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1239 ConstructedInterpolants, 0 QuantifiedInterpolants, 2147 SizeOfPredicates, 4 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 375/397 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= ((long long) 128 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) && ((\old(e) != 0) || (0 <= ((long long) e + 1)))) - ProcedureContractResult [Line: 24]: Procedure Contract for base2flt Derived contract for procedure base2flt. Requires: ((e <= 127) && (0 <= ((long long) 128 + e))) Ensures: ((e <= 127) && (0 <= ((long long) 128 + e))) - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-13 12:56:03,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE