./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.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 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:56:04,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:56:04,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:56:04,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:56:04,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:56:04,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:56:04,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:56:04,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:56:04,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:56:04,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:56:04,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:56:04,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:56:04,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:56:04,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:56:04,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:56:04,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:56:04,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:56:04,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:56:04,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:56:04,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:56:04,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:56:04,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:56:04,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:56:04,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:56:04,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:56:04,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:56:04,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:56:04,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:56:04,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:56:04,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:56:04,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:56:04,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:56:04,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:56:04,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:56:04,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:56:04,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:56:04,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:56:04,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:56:04,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:56:04,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:56:04,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:56:04,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:56:04,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:56:04,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:56:04,244 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 -> 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 [2024-11-09 11:56:04,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:56:04,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:56:04,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:56:04,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:56:04,543 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:56:04,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-09 11:56:05,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:56:06,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:56:06,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-09 11:56:06,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50a7fc3c/9a42796aad3e45b4b8e0dd82a6f72569/FLAGfc8447119 [2024-11-09 11:56:06,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50a7fc3c/9a42796aad3e45b4b8e0dd82a6f72569 [2024-11-09 11:56:06,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:56:06,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:56:06,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:56:06,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:56:06,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:56:06,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1179b21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06, skipping insertion in model container [2024-11-09 11:56:06,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:56:06,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:56:06,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:56:06,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:56:06,709 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:56:06,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06 WrapperNode [2024-11-09 11:56:06,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:56:06,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:56:06,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:56:06,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:56:06,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,736 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-09 11:56:06,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:56:06,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:56:06,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:56:06,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:56:06,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:56:06,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:56:06,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:56:06,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:56:06,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:56:06,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (1/1) ... [2024-11-09 11:56:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:56:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:06,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:56:06,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:56:06,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:56:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:56:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:56:06,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:56:06,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:56:06,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:56:06,922 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:56:06,924 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:56:07,198 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 11:56:07,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:56:07,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:56:07,215 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 11:56:07,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07 BoogieIcfgContainer [2024-11-09 11:56:07,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:56:07,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:56:07,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:56:07,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:56:07,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:56:06" (1/3) ... [2024-11-09 11:56:07,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647da66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:07, skipping insertion in model container [2024-11-09 11:56:07,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:56:06" (2/3) ... [2024-11-09 11:56:07,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647da66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:56:07, skipping insertion in model container [2024-11-09 11:56:07,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07" (3/3) ... [2024-11-09 11:56:07,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2024-11-09 11:56:07,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:56:07,248 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:56:07,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:56:07,320 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;@48eccdf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:56:07,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:56:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 11:56:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:56:07,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:56:07,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-09 11:56:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113263586] [2024-11-09 11:56:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113263586] [2024-11-09 11:56:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113263586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:07,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964635064] [2024-11-09 11:56:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:56:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:56:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:56:07,524 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-09 11:56:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:07,546 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-09 11:56:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:56:07,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-09 11:56:07,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:07,554 INFO L225 Difference]: With dead ends: 68 [2024-11-09 11:56:07,554 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 11:56:07,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:56:07,562 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:07,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 11:56:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 11:56:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 11:56:07,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2024-11-09 11:56:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 11:56:07,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-09 11:56:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 11:56:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 11:56:07,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 11:56:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:56:07,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-09 11:56:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643037162] [2024-11-09 11:56:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643037162] [2024-11-09 11:56:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643037162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235810181] [2024-11-09 11:56:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:07,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:56:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:56:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:56:07,690 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 11:56:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:07,748 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-09 11:56:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:56:07,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-11-09 11:56:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:07,750 INFO L225 Difference]: With dead ends: 37 [2024-11-09 11:56:07,750 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 11:56:07,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:56:07,752 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 11:56:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-09 11:56:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-09 11:56:07,760 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-11-09 11:56:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:07,760 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-09 11:56:07,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 11:56:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-09 11:56:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 11:56:07,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:07,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:56:07,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-09 11:56:07,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745316835] [2024-11-09 11:56:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:56:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:07,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745316835] [2024-11-09 11:56:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745316835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:56:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56744059] [2024-11-09 11:56:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:56:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:56:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:56:07,832 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 11:56:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:07,876 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-09 11:56:07,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:56:07,879 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), 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) Word has length 7 [2024-11-09 11:56:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:07,879 INFO L225 Difference]: With dead ends: 50 [2024-11-09 11:56:07,879 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:56:07,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:56:07,881 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:07,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:56:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:56:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 11:56:07,889 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-11-09 11:56:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:07,890 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 11:56:07,890 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), 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-11-09 11:56:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 11:56:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:56:07,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:07,894 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] [2024-11-09 11:56:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:56:07,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1297109879, now seen corresponding path program 1 times [2024-11-09 11:56:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762110562] [2024-11-09 11:56:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:07,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762110562] [2024-11-09 11:56:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762110562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:56:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892171639] [2024-11-09 11:56:08,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:56:08,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:56:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:56:08,138 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,201 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-09 11:56:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:56:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-09 11:56:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,202 INFO L225 Difference]: With dead ends: 35 [2024-11-09 11:56:08,202 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:56:08,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:08,204 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 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-11-09 11:56:08,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:56:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 11:56:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:56:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-09 11:56:08,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2024-11-09 11:56:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-09 11:56:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-09 11:56:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:56:08,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,218 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] [2024-11-09 11:56:08,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:56:08,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1555700513, now seen corresponding path program 1 times [2024-11-09 11:56:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386639613] [2024-11-09 11:56:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386639613] [2024-11-09 11:56:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386639613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:56:08,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:56:08,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120664681] [2024-11-09 11:56:08,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:56:08,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:56:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:56:08,412 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,574 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-09 11:56:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:56:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 11:56:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,577 INFO L225 Difference]: With dead ends: 51 [2024-11-09 11:56:08,577 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 11:56:08,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:08,579 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 11:56:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-09 11:56:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:56:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-09 11:56:08,588 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2024-11-09 11:56:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,589 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-09 11:56:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-09 11:56:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:56:08,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:56:08,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1555664763, now seen corresponding path program 1 times [2024-11-09 11:56:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740005438] [2024-11-09 11:56:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740005438] [2024-11-09 11:56:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740005438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485924688] [2024-11-09 11:56:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:08,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:08,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:08,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:56:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:08,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:56:08,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:08,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:56:08,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485924688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:08,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:56:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 11:56:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154554945] [2024-11-09 11:56:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:08,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:56:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:56:08,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:56:08,870 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:08,944 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-09 11:56:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:56:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 11:56:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:08,946 INFO L225 Difference]: With dead ends: 49 [2024-11-09 11:56:08,947 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 11:56:08,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:56:08,949 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:08,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 11:56:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-09 11:56:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:56:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-09 11:56:08,965 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2024-11-09 11:56:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:08,966 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-09 11:56:08,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 11:56:08,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-09 11:56:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 11:56:08,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:08,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:08,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:56:09,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:56:09,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1040655112, now seen corresponding path program 1 times [2024-11-09 11:56:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278180131] [2024-11-09 11:56:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278180131] [2024-11-09 11:56:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278180131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410546552] [2024-11-09 11:56:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:09,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:09,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:56:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:56:09,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 11:56:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410546552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:09,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 11:56:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350062781] [2024-11-09 11:56:09,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:09,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:56:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:56:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:56:09,467 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:56:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:09,648 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-09 11:56:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 11:56:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2024-11-09 11:56:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:09,650 INFO L225 Difference]: With dead ends: 93 [2024-11-09 11:56:09,650 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 11:56:09,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-09 11:56:09,652 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:09,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:56:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 11:56:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2024-11-09 11:56:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 11:56:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-09 11:56:09,665 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2024-11-09 11:56:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:09,666 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-09 11:56:09,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 11:56:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-09 11:56:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 11:56:09,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:09,668 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:09,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 11:56:09,871 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,SelfDestructingSolverStorable6 [2024-11-09 11:56:09,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 182070449, now seen corresponding path program 1 times [2024-11-09 11:56:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:09,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317736091] [2024-11-09 11:56:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317736091] [2024-11-09 11:56:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317736091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152544255] [2024-11-09 11:56:10,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:10,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:10,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:10,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:56:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:10,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:56:10,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 11:56:10,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152544255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:10,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-09 11:56:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836806522] [2024-11-09 11:56:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:56:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:56:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:56:10,376 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 11:56:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:10,754 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-09 11:56:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 11:56:10,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2024-11-09 11:56:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:10,756 INFO L225 Difference]: With dead ends: 133 [2024-11-09 11:56:10,756 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 11:56:10,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 11:56:10,760 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:10,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:56:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 11:56:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-09 11:56:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 11:56:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2024-11-09 11:56:10,777 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2024-11-09 11:56:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:10,778 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2024-11-09 11:56:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-09 11:56:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-11-09 11:56:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 11:56:10,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:10,781 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:10,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 11:56:10,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:10,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:10,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:10,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1955862377, now seen corresponding path program 2 times [2024-11-09 11:56:10,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:10,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908983394] [2024-11-09 11:56:10,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:56:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 11:56:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:56:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:56:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:56:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908983394] [2024-11-09 11:56:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908983394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243542699] [2024-11-09 11:56:11,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:56:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:11,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:11,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:56:11,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:56:11,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:56:11,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 11:56:11,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 11:56:11,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 11:56:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243542699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:11,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:11,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-09 11:56:11,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284411424] [2024-11-09 11:56:11,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:11,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 11:56:11,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:11,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 11:56:11,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:56:11,935 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 11:56:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:12,411 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-09 11:56:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 11:56:12,412 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-11-09 11:56:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:12,414 INFO L225 Difference]: With dead ends: 196 [2024-11-09 11:56:12,414 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 11:56:12,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 11:56:12,416 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:12,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 250 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:56:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 11:56:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2024-11-09 11:56:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 11:56:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-11-09 11:56:12,442 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2024-11-09 11:56:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-11-09 11:56:12,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-09 11:56:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-11-09 11:56:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 11:56:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:12,450 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:12,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 11:56:12,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:12,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1533400926, now seen corresponding path program 1 times [2024-11-09 11:56:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953692561] [2024-11-09 11:56:12,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:56:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:56:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 11:56:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 11:56:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 11:56:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 11:56:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 11:56:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953692561] [2024-11-09 11:56:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953692561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135197705] [2024-11-09 11:56:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:13,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:13,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:13,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:56:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:13,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 11:56:13,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:56:13,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 11:56:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135197705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:13,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2024-11-09 11:56:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856096554] [2024-11-09 11:56:13,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:13,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 11:56:13,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:13,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 11:56:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 11:56:13,930 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-09 11:56:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:15,058 INFO L93 Difference]: Finished difference Result 370 states and 444 transitions. [2024-11-09 11:56:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-09 11:56:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 111 [2024-11-09 11:56:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:15,062 INFO L225 Difference]: With dead ends: 370 [2024-11-09 11:56:15,062 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 11:56:15,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2024-11-09 11:56:15,067 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 265 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:15,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 380 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:56:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 11:56:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2024-11-09 11:56:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 11:56:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2024-11-09 11:56:15,097 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 111 [2024-11-09 11:56:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2024-11-09 11:56:15,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-09 11:56:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2024-11-09 11:56:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 11:56:15,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:15,102 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:15,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 11:56:15,302 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,SelfDestructingSolverStorable9 [2024-11-09 11:56:15,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1354925193, now seen corresponding path program 2 times [2024-11-09 11:56:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895824227] [2024-11-09 11:56:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:56:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 11:56:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:56:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 11:56:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 11:56:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 11:56:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 11:56:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 11:56:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 11:56:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 11:56:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 11:56:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-09 11:56:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 11:56:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:56:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-09 11:56:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-09 11:56:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-09 11:56:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-09 11:56:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-09 11:56:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-09 11:56:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-09 11:56:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-09 11:56:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895824227] [2024-11-09 11:56:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895824227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259797135] [2024-11-09 11:56:16,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:56:16,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:16,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:16,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:16,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:56:16,574 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:56:16,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:56:16,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 11:56:16,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 11:56:16,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:56:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-09 11:56:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259797135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:56:17,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:56:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 29] total 57 [2024-11-09 11:56:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234980764] [2024-11-09 11:56:17,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:56:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 11:56:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 11:56:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 11:56:17,716 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-09 11:56:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:19,310 INFO L93 Difference]: Finished difference Result 762 states and 904 transitions. [2024-11-09 11:56:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-09 11:56:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) Word has length 227 [2024-11-09 11:56:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:19,318 INFO L225 Difference]: With dead ends: 762 [2024-11-09 11:56:19,318 INFO L226 Difference]: Without dead ends: 761 [2024-11-09 11:56:19,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3562, Invalid=10244, Unknown=0, NotChecked=0, Total=13806 [2024-11-09 11:56:19,323 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 421 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:19,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 349 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:56:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-09 11:56:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 356. [2024-11-09 11:56:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 261 states have internal predecessors, (293), 65 states have call successors, (65), 29 states have call predecessors, (65), 29 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 11:56:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2024-11-09 11:56:19,368 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 227 [2024-11-09 11:56:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2024-11-09 11:56:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-09 11:56:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2024-11-09 11:56:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 11:56:19,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:56:19,374 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:19,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 11:56:19,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:19,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:56:19,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:56:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash -721746986, now seen corresponding path program 3 times [2024-11-09 11:56:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:56:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805033293] [2024-11-09 11:56:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:56:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:56:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:56:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 11:56:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 11:56:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 11:56:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 11:56:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 11:56:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 11:56:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 11:56:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 11:56:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 11:56:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 11:56:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 11:56:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 11:56:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 11:56:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 11:56:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 11:56:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 11:56:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 11:56:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 11:56:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 11:56:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-09 11:56:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-09 11:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-09 11:56:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-09 11:56:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-09 11:56:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-09 11:56:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-09 11:56:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-09 11:56:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-09 11:56:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-09 11:56:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-09 11:56:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-09 11:56:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-09 11:56:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-09 11:56:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:56:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-09 11:56:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:56:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805033293] [2024-11-09 11:56:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805033293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:56:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617376439] [2024-11-09 11:56:20,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:56:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:56:20,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:56:20,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:56:21,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 11:56:21,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:56:21,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:56:21,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:56:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked. [2024-11-09 11:56:21,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:56:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617376439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:56:21,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:56:21,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-09 11:56:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986009236] [2024-11-09 11:56:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:56:21,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:56:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:56:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:56:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 11:56:21,163 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 11:56:21,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:56:21,244 INFO L93 Difference]: Finished difference Result 364 states and 431 transitions. [2024-11-09 11:56:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:56:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 263 [2024-11-09 11:56:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:56:21,246 INFO L225 Difference]: With dead ends: 364 [2024-11-09 11:56:21,246 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:56:21,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 11:56:21,248 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:56:21,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:56:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:56:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:56:21,251 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-11-09 11:56:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:56:21,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-11-09 11:56:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:56:21,252 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:56:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 11:56:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:56:21,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:56:21,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:56:21,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:56:21,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:56:21,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:56:21,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:56:21,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:56:21,462 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:56:21,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:56:22,639 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:56:22,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:56:22 BoogieIcfgContainer [2024-11-09 11:56:22,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:56:22,654 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:56:22,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:56:22,654 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:56:22,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:56:07" (3/4) ... [2024-11-09 11:56:22,657 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:56:22,661 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 11:56:22,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 11:56:22,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:56:22,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:56:22,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:56:22,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:56:22,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:56:22,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:56:22,757 INFO L158 Benchmark]: Toolchain (without parser) took 16298.41ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 145.1MB in the beginning and 202.8MB in the end (delta: -57.6MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,757 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory was 142.2MB in the beginning and 142.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:56:22,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.66ms. Allocated memory is still 174.1MB. Free memory was 145.1MB in the beginning and 132.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.74ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,758 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 128.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,758 INFO L158 Benchmark]: RCFGBuilder took 442.32ms. Allocated memory is still 174.1MB. Free memory was 128.8MB in the beginning and 138.3MB in the end (delta: -9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,758 INFO L158 Benchmark]: TraceAbstraction took 15434.55ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 138.3MB in the beginning and 207.0MB in the end (delta: -68.6MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,758 INFO L158 Benchmark]: Witness Printer took 102.16ms. Allocated memory is still 362.8MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:56:22,762 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 174.1MB. Free memory was 142.2MB in the beginning and 142.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.66ms. Allocated memory is still 174.1MB. Free memory was 145.1MB in the beginning and 132.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.74ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 130.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 128.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.32ms. Allocated memory is still 174.1MB. Free memory was 128.8MB in the beginning and 138.3MB in the end (delta: -9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15434.55ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 138.3MB in the beginning and 207.0MB in the end (delta: -68.6MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. * Witness Printer took 102.16ms. Allocated memory is still 362.8MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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: 45]: 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 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 12, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1484 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 326 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1404 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=11, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 583 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4471 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9890/14155 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 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483637)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:56:22,796 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