./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/cohencu.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/cohencu.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 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:29:58,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:29:58,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:29:58,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:29:58,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:29:58,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:29:58,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:29:58,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:29:58,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:29:58,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:29:58,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:29:58,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:29:58,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:29:58,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:29:58,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:29:58,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:29:58,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:29:58,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:29:58,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:29:58,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:29:58,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:29:58,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:29:58,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:29:58,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:29:58,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:29:58,247 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:29:58,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:29:58,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:29:58,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:29:58,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:29:58,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:29:58,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:29:58,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:29:58,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:29:58,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:29:58,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:29:58,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:29:58,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:29:58,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:29:58,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:29:58,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:29:58,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:29:58,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:29:58,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:29:58,253 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 -> 97975d1d0cca27fb3b198cb58b8a28ecc801f4371efebfb415ca164ff6598233 [2024-11-09 11:29:58,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:29:58,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:29:58,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:29:58,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:29:58,532 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:29:58,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/cohencu.c [2024-11-09 11:29:59,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:30:00,142 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:30:00,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/cohencu.c [2024-11-09 11:30:00,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f99bf7f/19d67cf2b26c4fe79dcb831fc29928df/FLAG328f28d02 [2024-11-09 11:30:00,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f99bf7f/19d67cf2b26c4fe79dcb831fc29928df [2024-11-09 11:30:00,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:30:00,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:30:00,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:30:00,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:30:00,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:30:00,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481886c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00, skipping insertion in model container [2024-11-09 11:30:00,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:30:00,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:30:00,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:30:00,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:30:00,869 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:30:00,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00 WrapperNode [2024-11-09 11:30:00,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:30:00,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:30:00,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:30:00,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:30:00,879 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:30:00" (1/1) ... [2024-11-09 11:30:00,888 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:30:00" (1/1) ... [2024-11-09 11:30:00,942 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-11-09 11:30:00,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:30:00,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:30:00,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:30:00,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:30:00,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,992 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:30:00,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:00,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:30:01,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:30:01,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:30:01,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:30:01,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (1/1) ... [2024-11-09 11:30:01,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:30:01,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:30:01,062 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:30:01,069 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:30:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:30:01,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:30:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:30:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:30:01,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:30:01,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:30:01,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:30:01,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:30:02,066 INFO L? ?]: Removed 237 outVars from TransFormulas that were not future-live. [2024-11-09 11:30:02,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:30:02,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:30:02,104 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:30:02,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:30:02 BoogieIcfgContainer [2024-11-09 11:30:02,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:30:02,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:30:02,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:30:02,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:30:02,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:30:00" (1/3) ... [2024-11-09 11:30:02,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a22ed7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:30:02, skipping insertion in model container [2024-11-09 11:30:02,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:30:00" (2/3) ... [2024-11-09 11:30:02,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a22ed7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:30:02, skipping insertion in model container [2024-11-09 11:30:02,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:30:02" (3/3) ... [2024-11-09 11:30:02,115 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu.c [2024-11-09 11:30:02,133 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:30:02,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-11-09 11:30:02,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:30:02,231 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;@1f578216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:30:02,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-11-09 11:30:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 150 states have (on average 1.9466666666666668) internal successors, (292), 288 states have internal predecessors, (292), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 11:30:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:30:02,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:02,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:30:02,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:02,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 929637, now seen corresponding path program 1 times [2024-11-09 11:30:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597606496] [2024-11-09 11:30:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:02,453 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:30:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597606496] [2024-11-09 11:30:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597606496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372783103] [2024-11-09 11:30:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:02,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:30:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:30:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:30:02,488 INFO L87 Difference]: Start difference. First operand has 301 states, 150 states have (on average 1.9466666666666668) internal successors, (292), 288 states have internal predecessors, (292), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:30:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:02,532 INFO L93 Difference]: Finished difference Result 592 states and 636 transitions. [2024-11-09 11:30:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:30:02,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-09 11:30:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:02,546 INFO L225 Difference]: With dead ends: 592 [2024-11-09 11:30:02,546 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 11:30:02,550 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:30:02,553 INFO L432 NwaCegarLoop]: 303 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, 303 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:30:02,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:30:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 11:30:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-09 11:30:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 145 states have (on average 1.903448275862069) internal successors, (276), 275 states have internal predecessors, (276), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 11:30:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 296 transitions. [2024-11-09 11:30:02,607 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 296 transitions. Word has length 4 [2024-11-09 11:30:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:02,607 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 296 transitions. [2024-11-09 11:30:02,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:30:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 296 transitions. [2024-11-09 11:30:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 11:30:02,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:02,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 11:30:02,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:30:02,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:02,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2024-11-09 11:30:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014229023] [2024-11-09 11:30:02,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:02,672 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:30:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014229023] [2024-11-09 11:30:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014229023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877299764] [2024-11-09 11:30:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:02,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:02,680 INFO L87 Difference]: Start difference. First operand 287 states and 296 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:30:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:02,851 INFO L93 Difference]: Finished difference Result 556 states and 575 transitions. [2024-11-09 11:30:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-09 11:30:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:02,856 INFO L225 Difference]: With dead ends: 556 [2024-11-09 11:30:02,856 INFO L226 Difference]: Without dead ends: 536 [2024-11-09 11:30:02,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:02,861 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 237 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:02,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 519 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:30:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-09 11:30:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 346. [2024-11-09 11:30:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 199 states have (on average 1.7989949748743719) internal successors, (358), 329 states have internal predecessors, (358), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 11:30:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2024-11-09 11:30:02,886 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 4 [2024-11-09 11:30:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:02,886 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2024-11-09 11:30:02,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:30:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2024-11-09 11:30:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 11:30:02,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:02,888 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:02,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:30:02,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1941357529, now seen corresponding path program 1 times [2024-11-09 11:30:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722157598] [2024-11-09 11:30:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:02,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:30:02,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214916639] [2024-11-09 11:30:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:30:02,931 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:30:02,932 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:30:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:02,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:30:02,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:30:03,177 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:30:03,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:30:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722157598] [2024-11-09 11:30:03,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:30:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214916639] [2024-11-09 11:30:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214916639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726358997] [2024-11-09 11:30:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:03,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:03,181 INFO L87 Difference]: Start difference. First operand 346 states and 388 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:30:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:03,633 INFO L93 Difference]: Finished difference Result 506 states and 563 transitions. [2024-11-09 11:30:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:03,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2024-11-09 11:30:03,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:03,639 INFO L225 Difference]: With dead ends: 506 [2024-11-09 11:30:03,639 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 11:30:03,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:03,643 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 134 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:03,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 266 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:30:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 11:30:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 431. [2024-11-09 11:30:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.6523297491039426) internal successors, (461), 409 states have internal predecessors, (461), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 501 transitions. [2024-11-09 11:30:03,680 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 501 transitions. Word has length 37 [2024-11-09 11:30:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:03,681 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 501 transitions. [2024-11-09 11:30:03,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:30:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 501 transitions. [2024-11-09 11:30:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 11:30:03,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:03,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:03,715 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:30:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:03,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1628776215, now seen corresponding path program 1 times [2024-11-09 11:30:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377712032] [2024-11-09 11:30:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,067 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:30:04,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377712032] [2024-11-09 11:30:04,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377712032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:04,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:04,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201953847] [2024-11-09 11:30:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:04,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:04,072 INFO L87 Difference]: Start difference. First operand 431 states and 501 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:30:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:04,421 INFO L93 Difference]: Finished difference Result 464 states and 508 transitions. [2024-11-09 11:30:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 39 [2024-11-09 11:30:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:04,424 INFO L225 Difference]: With dead ends: 464 [2024-11-09 11:30:04,425 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 11:30:04,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:04,426 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:04,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 424 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:30:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 11:30:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2024-11-09 11:30:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5698924731182795) internal successors, (438), 409 states have internal predecessors, (438), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 478 transitions. [2024-11-09 11:30:04,443 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 478 transitions. Word has length 39 [2024-11-09 11:30:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:04,444 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 478 transitions. [2024-11-09 11:30:04,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:30:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 478 transitions. [2024-11-09 11:30:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 11:30:04,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:04,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:04,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:30:04,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:04,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:04,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1885844053, now seen corresponding path program 1 times [2024-11-09 11:30:04,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:04,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830723769] [2024-11-09 11:30:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:04,581 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:30:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:04,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830723769] [2024-11-09 11:30:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830723769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:30:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678080130] [2024-11-09 11:30:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:04,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:30:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:30:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:04,588 INFO L87 Difference]: Start difference. First operand 431 states and 478 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:30:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:05,185 INFO L93 Difference]: Finished difference Result 443 states and 485 transitions. [2024-11-09 11:30:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:30:05,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2024-11-09 11:30:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:05,188 INFO L225 Difference]: With dead ends: 443 [2024-11-09 11:30:05,188 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 11:30:05,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:05,189 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 253 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:05,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 366 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 11:30:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 11:30:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2024-11-09 11:30:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5627240143369177) internal successors, (436), 409 states have internal predecessors, (436), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 476 transitions. [2024-11-09 11:30:05,204 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 476 transitions. Word has length 41 [2024-11-09 11:30:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 476 transitions. [2024-11-09 11:30:05,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:30:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 476 transitions. [2024-11-09 11:30:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:30:05,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:05,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:05,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:30:05,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:05,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1668376593, now seen corresponding path program 1 times [2024-11-09 11:30:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169196701] [2024-11-09 11:30:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:05,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:05,334 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:30:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169196701] [2024-11-09 11:30:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169196701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:30:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425785236] [2024-11-09 11:30:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:30:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:30:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:05,337 INFO L87 Difference]: Start difference. First operand 431 states and 476 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:30:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:06,742 INFO L93 Difference]: Finished difference Result 443 states and 483 transitions. [2024-11-09 11:30:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:30:06,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 42 [2024-11-09 11:30:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:06,746 INFO L225 Difference]: With dead ends: 443 [2024-11-09 11:30:06,746 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 11:30:06,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:06,749 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 252 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:06,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 368 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 11:30:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 11:30:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 431. [2024-11-09 11:30:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 279 states have (on average 1.5555555555555556) internal successors, (434), 409 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 474 transitions. [2024-11-09 11:30:06,773 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 474 transitions. Word has length 42 [2024-11-09 11:30:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:06,774 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 474 transitions. [2024-11-09 11:30:06,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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:30:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 474 transitions. [2024-11-09 11:30:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 11:30:06,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:06,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:06,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:30:06,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1245626159, now seen corresponding path program 1 times [2024-11-09 11:30:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:06,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810426295] [2024-11-09 11:30:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:30:06,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536909265] [2024-11-09 11:30:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:30:06,794 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:30:06,795 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:30:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:06,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 11:30:06,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:30:07,093 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:30:07,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:30:07,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:07,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810426295] [2024-11-09 11:30:07,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 11:30:07,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536909265] [2024-11-09 11:30:07,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536909265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:07,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:07,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241370851] [2024-11-09 11:30:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:07,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:07,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:07,098 INFO L87 Difference]: Start difference. First operand 431 states and 474 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:30:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:07,546 INFO L93 Difference]: Finished difference Result 448 states and 481 transitions. [2024-11-09 11:30:07,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:07,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 45 [2024-11-09 11:30:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:07,549 INFO L225 Difference]: With dead ends: 448 [2024-11-09 11:30:07,549 INFO L226 Difference]: Without dead ends: 439 [2024-11-09 11:30:07,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:07,551 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 112 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:07,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 256 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:30:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-09 11:30:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2024-11-09 11:30:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 412 states have internal predecessors, (431), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 471 transitions. [2024-11-09 11:30:07,565 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 471 transitions. Word has length 45 [2024-11-09 11:30:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 471 transitions. [2024-11-09 11:30:07,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:30:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 471 transitions. [2024-11-09 11:30:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:30:07,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:07,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:07,586 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:30:07,770 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:30:07,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -40294635, now seen corresponding path program 1 times [2024-11-09 11:30:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920267145] [2024-11-09 11:30:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:07,884 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:30:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920267145] [2024-11-09 11:30:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920267145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:07,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:30:07,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422236157] [2024-11-09 11:30:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:30:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:30:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:07,886 INFO L87 Difference]: Start difference. First operand 434 states and 471 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:30:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:08,299 INFO L93 Difference]: Finished difference Result 447 states and 472 transitions. [2024-11-09 11:30:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:30:08,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 46 [2024-11-09 11:30:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:08,302 INFO L225 Difference]: With dead ends: 447 [2024-11-09 11:30:08,302 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 11:30:08,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:08,303 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 244 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:08,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 304 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 11:30:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 11:30:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2024-11-09 11:30:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 412 states have internal predecessors, (425), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 11:30:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 465 transitions. [2024-11-09 11:30:08,315 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 465 transitions. Word has length 46 [2024-11-09 11:30:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:08,315 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 465 transitions. [2024-11-09 11:30:08,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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:30:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 465 transitions. [2024-11-09 11:30:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 11:30:08,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:08,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:08,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:30:08,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:08,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:08,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1341815271, now seen corresponding path program 1 times [2024-11-09 11:30:08,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:08,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512068141] [2024-11-09 11:30:08,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:08,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:08,432 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:30:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512068141] [2024-11-09 11:30:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512068141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:08,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:08,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:30:08,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590394302] [2024-11-09 11:30:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:08,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:30:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:30:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:08,435 INFO L87 Difference]: Start difference. First operand 434 states and 465 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:30:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:08,933 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2024-11-09 11:30:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 50 [2024-11-09 11:30:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:08,935 INFO L225 Difference]: With dead ends: 445 [2024-11-09 11:30:08,935 INFO L226 Difference]: Without dead ends: 372 [2024-11-09 11:30:08,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:30:08,936 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 226 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:08,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 268 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 11:30:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-09 11:30:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 368. [2024-11-09 11:30:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 219 states have (on average 1.6255707762557077) internal successors, (356), 349 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 11:30:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 390 transitions. [2024-11-09 11:30:08,949 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 390 transitions. Word has length 50 [2024-11-09 11:30:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 390 transitions. [2024-11-09 11:30:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:30:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 390 transitions. [2024-11-09 11:30:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 11:30:08,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:08,951 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:08,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:30:08,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 707212059, now seen corresponding path program 1 times [2024-11-09 11:30:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383070135] [2024-11-09 11:30:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:08,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:30:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:30:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:30:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383070135] [2024-11-09 11:30:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383070135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:09,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651499134] [2024-11-09 11:30:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:09,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:09,058 INFO L87 Difference]: Start difference. First operand 368 states and 390 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:30:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:09,401 INFO L93 Difference]: Finished difference Result 368 states and 390 transitions. [2024-11-09 11:30:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 82 [2024-11-09 11:30:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:09,403 INFO L225 Difference]: With dead ends: 368 [2024-11-09 11:30:09,404 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 11:30:09,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:09,406 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 138 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:09,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:30:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 11:30:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-11-09 11:30:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 342 states have internal predecessors, (349), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 11:30:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 383 transitions. [2024-11-09 11:30:09,418 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 383 transitions. Word has length 82 [2024-11-09 11:30:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:09,419 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 383 transitions. [2024-11-09 11:30:09,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:30:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 383 transitions. [2024-11-09 11:30:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 11:30:09,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:09,424 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 11:30:09,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash 448737508, now seen corresponding path program 1 times [2024-11-09 11:30:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:09,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529889165] [2024-11-09 11:30:09,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:30:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 11:30:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 11:30:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 11:30:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 11:30:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:30:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 11:30:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:30:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529889165] [2024-11-09 11:30:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529889165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:30:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:30:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:30:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125540799] [2024-11-09 11:30:09,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:30:09,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:30:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:30:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:30:09,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:09,498 INFO L87 Difference]: Start difference. First operand 361 states and 383 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:30:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:30:09,796 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2024-11-09 11:30:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:30:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2024-11-09 11:30:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:30:09,799 INFO L225 Difference]: With dead ends: 368 [2024-11-09 11:30:09,799 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 11:30:09,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:30:09,800 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 11:30:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 391 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 11:30:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 11:30:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 363. [2024-11-09 11:30:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 221 states have (on average 1.588235294117647) internal successors, (351), 344 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 11:30:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 385 transitions. [2024-11-09 11:30:09,814 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 385 transitions. Word has length 83 [2024-11-09 11:30:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:30:09,814 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 385 transitions. [2024-11-09 11:30:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:30:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 385 transitions. [2024-11-09 11:30:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 11:30:09,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:30:09,819 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:09,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 11:30:09,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 135 more)] === [2024-11-09 11:30:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:30:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1949499947, now seen corresponding path program 1 times [2024-11-09 11:30:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:30:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099512625] [2024-11-09 11:30:09,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:30:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 11:30:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605677044] [2024-11-09 11:30:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:30:09,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:09,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:30:09,844 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:30:09,846 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:30:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:30:09,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 11:30:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 11:30:09,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 11:30:09,963 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 11:30:09,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-11-09 11:30:09,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-11-09 11:30:09,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-11-09 11:30:09,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-11-09 11:30:09,973 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-11-09 11:30:09,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-11-09 11:30:09,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-11-09 11:30:09,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-11-09 11:30:09,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-11-09 11:30:09,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-11-09 11:30:09,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-11-09 11:30:09,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-11-09 11:30:09,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-11-09 11:30:09,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-11-09 11:30:09,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-11-09 11:30:09,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-11-09 11:30:09,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-11-09 11:30:09,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-11-09 11:30:09,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-11-09 11:30:09,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-11-09 11:30:09,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-11-09 11:30:09,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-11-09 11:30:09,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-11-09 11:30:09,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-11-09 11:30:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-11-09 11:30:09,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-11-09 11:30:09,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-11-09 11:30:09,988 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-11-09 11:30:09,989 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-11-09 11:30:09,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-11-09 11:30:09,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-11-09 11:30:09,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-11-09 11:30:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-11-09 11:30:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-11-09 11:30:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-11-09 11:30:09,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-11-09 11:30:10,022 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:30:10,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:30:10,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:30:10,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:30:10,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:30:10 BoogieIcfgContainer [2024-11-09 11:30:10,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:30:10,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:30:10,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:30:10,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:30:10,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:30:02" (3/4) ... [2024-11-09 11:30:10,262 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 11:30:10,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:30:10,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:30:10,320 INFO L158 Benchmark]: Toolchain (without parser) took 9777.99ms. Allocated memory was 130.0MB in the beginning and 207.6MB in the end (delta: 77.6MB). Free memory was 61.2MB in the beginning and 168.3MB in the end (delta: -107.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:30:10,320 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 130.0MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:30:10,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.80ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 61.0MB in the beginning and 137.6MB in the end (delta: -76.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.88ms. Allocated memory is still 172.0MB. Free memory was 137.6MB in the beginning and 134.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,321 INFO L158 Benchmark]: Boogie Preprocessor took 78.80ms. Allocated memory is still 172.0MB. Free memory was 134.7MB in the beginning and 132.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,321 INFO L158 Benchmark]: RCFGBuilder took 1081.62ms. Allocated memory is still 172.0MB. Free memory was 132.6MB in the beginning and 93.5MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,321 INFO L158 Benchmark]: TraceAbstraction took 8153.51ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 92.8MB in the beginning and 171.5MB in the end (delta: -78.7MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,322 INFO L158 Benchmark]: Witness Printer took 58.65ms. Allocated memory is still 207.6MB. Free memory was 171.5MB in the beginning and 168.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:30:10,323 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.94ms. Allocated memory is still 130.0MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.80ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 61.0MB in the beginning and 137.6MB in the end (delta: -76.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.88ms. Allocated memory is still 172.0MB. Free memory was 137.6MB in the beginning and 134.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.80ms. Allocated memory is still 172.0MB. Free memory was 134.7MB in the beginning and 132.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1081.62ms. Allocated memory is still 172.0MB. Free memory was 132.6MB in the beginning and 93.5MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8153.51ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 92.8MB in the beginning and 171.5MB in the end (delta: -78.7MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Witness Printer took 58.65ms. Allocated memory is still 207.6MB. Free memory was 171.5MB in the beginning and 168.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 46]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int a, n, x, y, z; [L24] a = __VERIFIER_nondet_int() [L25] n = 0 [L26] x = 0 [L27] y = 1 [L28] z = 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L30] COND TRUE 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] EXPR 6 * n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L31] CALL __VERIFIER_assert(z == 6 * n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L31] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] EXPR 3 * n * n + 3 * n + 1 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L32] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L32] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] EXPR n * n * n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L33] CALL __VERIFIER_assert(x == n * n * n) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L33] RET __VERIFIER_assert(x == n * n * n) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] EXPR y*z - 18*x - 12*y + 2*z - 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L34] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L34] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR z*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] EXPR (z*z) - 12*y - 6*z + 12 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L35] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L36] COND TRUE !(n <= a) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] EXPR 6*n + 6 VAL [a=-357913942, n=0, x=0, y=1, z=6] [L45] CALL __VERIFIER_assert(z == 6*n + 6) [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L45] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=-357913942, n=0, x=0, y=1, z=6] [L46] 6*a VAL [n=0, x=0, y=1, z=6] - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 301 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1740 mSDsluCounter, 3618 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1383 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2370 IncrementalHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 2235 mSDtfsCounter, 2370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=7, InterpolantAutomatonStates: 35, 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, 11 MinimizatonAttempts, 260 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 164/164 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 11:30:10,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)