./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.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 3ca98dad7c6843faae7ffbd78338ffb7a6337381c6513f2024d9f758c8e3cfe5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:28,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:28,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:28,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:28,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:28,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:28,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:28,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:28,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:28,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:28,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:28,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:28,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:28,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:28,350 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:28,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:28,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:28,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:28,353 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:28,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:28,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:28,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:28,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3ca98dad7c6843faae7ffbd78338ffb7a6337381c6513f2024d9f758c8e3cfe5 [2025-04-29 11:00:28,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:28,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:28,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:28,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:28,574 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:28,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.c [2025-04-29 11:00:29,873 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edab1cea7/c07b22dd99504391adbe157d78dcfdd3/FLAG2263fe1a6 [2025-04-29 11:00:30,067 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:30,068 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrpbrk-alloca-2.c [2025-04-29 11:00:30,069 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:30,072 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edab1cea7/c07b22dd99504391adbe157d78dcfdd3/FLAG2263fe1a6 [2025-04-29 11:00:30,874 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edab1cea7/c07b22dd99504391adbe157d78dcfdd3 [2025-04-29 11:00:30,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:30,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:30,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:30,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:30,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:30,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:30" (1/1) ... [2025-04-29 11:00:30,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac708de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:30, skipping insertion in model container [2025-04-29 11:00:30,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:30" (1/1) ... [2025-04-29 11:00:30,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:31,043 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:31,050 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:31,071 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:31,081 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:31,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31 WrapperNode [2025-04-29 11:00:31,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:31,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:31,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:31,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:31,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,108 INFO L138 Inliner]: procedures = 10, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-04-29 11:00:31,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:31,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:31,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:31,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:31,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,126 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-04-29 11:00:31,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:31,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:31,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:31,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:31,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (1/1) ... [2025-04-29 11:00:31,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:31,166 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) [2025-04-29 11:00:31,168 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 [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:31,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:00:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:00:31,236 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:31,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:31,361 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-04-29 11:00:31,361 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:31,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:31,368 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:00:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:31 BoogieIcfgContainer [2025-04-29 11:00:31,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:31,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:31,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:31,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:31,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:30" (1/3) ... [2025-04-29 11:00:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c53e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:31, skipping insertion in model container [2025-04-29 11:00:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:31" (2/3) ... [2025-04-29 11:00:31,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c53e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:31, skipping insertion in model container [2025-04-29 11:00:31,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:31" (3/3) ... [2025-04-29 11:00:31,377 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca-2.c [2025-04-29 11:00:31,386 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:31,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrpbrk-alloca-2.c that has 1 procedures, 34 locations, 42 edges, 1 initial locations, 4 loop locations, and 8 error locations. [2025-04-29 11:00:31,420 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:31,430 INFO L340 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;@1bd54f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:31,431 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-29 11:00:31,433 INFO L278 IsEmpty]: Start isEmpty. Operand has 34 states, 25 states have (on average 1.68) internal successors, (42), 33 states have internal predecessors, (42), 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) [2025-04-29 11:00:31,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:00:31,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,438 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:31,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028967, now seen corresponding path program 1 times [2025-04-29 11:00:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444580022] [2025-04-29 11:00:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:31,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:31,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444580022] [2025-04-29 11:00:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444580022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:31,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:31,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194849215] [2025-04-29 11:00:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:31,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:31,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,655 INFO L87 Difference]: Start difference. First operand has 34 states, 25 states have (on average 1.68) internal successors, (42), 33 states have internal predecessors, (42), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,699 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-04-29 11:00:31,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:31,700 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:00:31,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,704 INFO L225 Difference]: With dead ends: 50 [2025-04-29 11:00:31,704 INFO L226 Difference]: Without dead ends: 26 [2025-04-29 11:00:31,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,710 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-29 11:00:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-29 11:00:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 25 states have internal predecessors, (30), 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) [2025-04-29 11:00:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-04-29 11:00:31,734 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 7 [2025-04-29 11:00:31,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,735 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-04-29 11:00:31,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:31,735 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-04-29 11:00:31,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:00:31,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:31,737 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:31,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 121329396, now seen corresponding path program 1 times [2025-04-29 11:00:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853076694] [2025-04-29 11:00:31,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:00:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:00:31,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853076694] [2025-04-29 11:00:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853076694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601706180] [2025-04-29 11:00:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:31,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:31,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:31,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,812 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-04-29 11:00:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:31,838 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-04-29 11:00:31,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:31,839 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-04-29 11:00:31,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:31,839 INFO L225 Difference]: With dead ends: 38 [2025-04-29 11:00:31,839 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 11:00:31,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:31,840 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:31,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 11:00:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-04-29 11:00:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 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) [2025-04-29 11:00:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-04-29 11:00:31,842 INFO L79 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 8 [2025-04-29 11:00:31,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:31,842 INFO L485 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-04-29 11:00:31,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-04-29 11:00:31,842 INFO L278 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-04-29 11:00:31,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:00:31,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:31,845 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:31,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:31,845 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:31,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 627462480, now seen corresponding path program 1 times [2025-04-29 11:00:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:31,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831754451] [2025-04-29 11:00:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:31,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:31,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:31,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:31,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831754451] [2025-04-29 11:00:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831754451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:31,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090847474] [2025-04-29 11:00:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:31,937 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) [2025-04-29 11:00:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:00:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:31,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:31,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090847474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:32,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:00:32,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857718245] [2025-04-29 11:00:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:32,018 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-04-29 11:00:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,038 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-04-29 11:00:32,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:32,039 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2025-04-29 11:00:32,039 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,039 INFO L225 Difference]: With dead ends: 25 [2025-04-29 11:00:32,039 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 11:00:32,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:32,040 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 11:00:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-29 11:00:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 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) [2025-04-29 11:00:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-04-29 11:00:32,043 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2025-04-29 11:00:32,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,043 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-04-29 11:00:32,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-04-29 11:00:32,043 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-04-29 11:00:32,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:00:32,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:00:32,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,247 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:32,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2023499547, now seen corresponding path program 1 times [2025-04-29 11:00:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840642183] [2025-04-29 11:00:32,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:32,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:32,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840642183] [2025-04-29 11:00:32,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840642183] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:32,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544748932] [2025-04-29 11:00:32,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:32,350 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) [2025-04-29 11:00:32,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:00:32,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:32,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:32,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:32,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544748932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:32,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-29 11:00:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828142312] [2025-04-29 11:00:32,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:00:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:00:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:00:32,488 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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) [2025-04-29 11:00:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,554 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-04-29 11:00:32,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:00:32,554 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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 11 [2025-04-29 11:00:32,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,556 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:00:32,556 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:00:32,556 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:00:32,557 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 121 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:00:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-04-29 11:00:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 43 states have internal predecessors, (54), 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) [2025-04-29 11:00:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-04-29 11:00:32,584 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 11 [2025-04-29 11:00:32,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,584 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-04-29 11:00:32,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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) [2025-04-29 11:00:32,584 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-04-29 11:00:32,584 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:00:32,584 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:32,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:00:32,785 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:32,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2023493525, now seen corresponding path program 1 times [2025-04-29 11:00:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400832962] [2025-04-29 11:00:32,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:32,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400832962] [2025-04-29 11:00:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400832962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687534981] [2025-04-29 11:00:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:32,836 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:00:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,857 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2025-04-29 11:00:32,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:32,858 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-04-29 11:00:32,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,858 INFO L225 Difference]: With dead ends: 52 [2025-04-29 11:00:32,858 INFO L226 Difference]: Without dead ends: 50 [2025-04-29 11:00:32,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:32,859 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-29 11:00:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-29 11:00:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 49 states have internal predecessors, (62), 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) [2025-04-29 11:00:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-04-29 11:00:32,866 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 11 [2025-04-29 11:00:32,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,866 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-04-29 11:00:32,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:00:32,867 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-04-29 11:00:32,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:00:32,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:32,868 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:32,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1043094285, now seen corresponding path program 1 times [2025-04-29 11:00:32,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481230156] [2025-04-29 11:00:32,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:32,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:32,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481230156] [2025-04-29 11:00:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481230156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110061546] [2025-04-29 11:00:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:32,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:32,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:32,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:32,911 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-04-29 11:00:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:32,925 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2025-04-29 11:00:32,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:32,925 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-04-29 11:00:32,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:32,926 INFO L225 Difference]: With dead ends: 58 [2025-04-29 11:00:32,926 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:00:32,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:32,926 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:32,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:00:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-04-29 11:00:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 48 states have internal predecessors, (59), 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) [2025-04-29 11:00:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-04-29 11:00:32,930 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 13 [2025-04-29 11:00:32,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:32,930 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-04-29 11:00:32,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-04-29 11:00:32,930 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-04-29 11:00:32,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:00:32,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:32,931 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:32,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:32,931 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:32,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2029541482, now seen corresponding path program 1 times [2025-04-29 11:00:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:32,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816144803] [2025-04-29 11:00:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:32,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:32,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:32,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:32,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:32,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816144803] [2025-04-29 11:00:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816144803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:32,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462080190] [2025-04-29 11:00:32,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:32,984 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) [2025-04-29 11:00:32,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:00:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:00:33,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:00:33,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:33,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:33,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462080190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-29 11:00:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901163426] [2025-04-29 11:00:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:33,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:33,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:33,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:33,053 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2025-04-29 11:00:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:33,069 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-04-29 11:00:33,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:33,069 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2025-04-29 11:00:33,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:33,069 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:00:33,069 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:00:33,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:33,070 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:33,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:00:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 11:00:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 47 states have internal predecessors, (57), 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) [2025-04-29 11:00:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-04-29 11:00:33,076 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 14 [2025-04-29 11:00:33,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:33,077 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-04-29 11:00:33,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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) [2025-04-29 11:00:33,077 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-04-29 11:00:33,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:00:33,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:33,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:33,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:00:33,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:33,281 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:33,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1508723561, now seen corresponding path program 1 times [2025-04-29 11:00:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:33,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398654618] [2025-04-29 11:00:33,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:33,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:00:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:00:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:33,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398654618] [2025-04-29 11:00:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398654618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:33,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224512944] [2025-04-29 11:00:33,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:33,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:33,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:33,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:00:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:00:33,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:00:33,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:33,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224512944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:33,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-29 11:00:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944247154] [2025-04-29 11:00:33,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:33,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:00:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:33,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:00:33,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:00:33,466 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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) [2025-04-29 11:00:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:33,526 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2025-04-29 11:00:33,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:00:33,526 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 15 [2025-04-29 11:00:33,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:33,527 INFO L225 Difference]: With dead ends: 118 [2025-04-29 11:00:33,527 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:00:33,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:00:33,528 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:33,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:00:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-04-29 11:00:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 84 states have (on average 1.25) internal successors, (105), 87 states have internal predecessors, (105), 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) [2025-04-29 11:00:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2025-04-29 11:00:33,534 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 15 [2025-04-29 11:00:33,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:33,534 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2025-04-29 11:00:33,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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) [2025-04-29 11:00:33,534 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2025-04-29 11:00:33,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:00:33,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:33,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:33,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:33,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:33,735 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:33,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1715988566, now seen corresponding path program 1 times [2025-04-29 11:00:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:33,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124135254] [2025-04-29 11:00:33,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:33,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:00:33,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:00:33,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:00:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:33,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124135254] [2025-04-29 11:00:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124135254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316128575] [2025-04-29 11:00:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:33,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:33,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:33,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:33,766 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-04-29 11:00:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:33,777 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2025-04-29 11:00:33,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:33,777 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2025-04-29 11:00:33,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:33,777 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:00:33,777 INFO L226 Difference]: Without dead ends: 81 [2025-04-29 11:00:33,778 INFO L436 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 [2025-04-29 11:00:33,778 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:33,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-29 11:00:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2025-04-29 11:00:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 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) [2025-04-29 11:00:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-04-29 11:00:33,785 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 18 [2025-04-29 11:00:33,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:33,785 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-04-29 11:00:33,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2025-04-29 11:00:33,785 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-04-29 11:00:33,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:00:33,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:33,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:33,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:33,786 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:33,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash 635282110, now seen corresponding path program 1 times [2025-04-29 11:00:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:33,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373657589] [2025-04-29 11:00:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:33,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:00:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:00:33,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:00:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:33,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373657589] [2025-04-29 11:00:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373657589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828267879] [2025-04-29 11:00:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:33,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:33,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:33,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:33,819 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-04-29 11:00:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:33,828 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-04-29 11:00:33,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:33,829 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2025-04-29 11:00:33,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:33,829 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:00:33,829 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:00:33,829 INFO L436 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 [2025-04-29 11:00:33,830 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:33,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:00:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-29 11:00:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 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) [2025-04-29 11:00:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-04-29 11:00:33,838 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 20 [2025-04-29 11:00:33,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:33,838 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-04-29 11:00:33,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-04-29 11:00:33,838 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-04-29 11:00:33,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:00:33,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:33,838 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:33,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:00:33,838 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:33,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2070514732, now seen corresponding path program 1 times [2025-04-29 11:00:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:33,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131002377] [2025-04-29 11:00:33,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:00:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:00:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:33,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131002377] [2025-04-29 11:00:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131002377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:33,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990795298] [2025-04-29 11:00:33,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:33,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:33,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:00:34,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:00:34,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:00:34,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:34,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:00:34,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:34,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:34,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990795298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:34,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:34,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:00:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148713013] [2025-04-29 11:00:34,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:34,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:00:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:00:34,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:34,189 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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) [2025-04-29 11:00:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:34,237 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2025-04-29 11:00:34,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:00:34,237 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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 20 [2025-04-29 11:00:34,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:34,238 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:00:34,238 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:00:34,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:34,239 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:34,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:00:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:00:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 94 states have internal predecessors, (108), 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) [2025-04-29 11:00:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-04-29 11:00:34,245 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 20 [2025-04-29 11:00:34,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:34,245 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-04-29 11:00:34,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 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) [2025-04-29 11:00:34,245 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-04-29 11:00:34,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:00:34,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:34,246 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:34,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:34,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:00:34,450 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:34,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1452978186, now seen corresponding path program 1 times [2025-04-29 11:00:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:34,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274067317] [2025-04-29 11:00:34,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:34,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:00:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:00:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:34,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:34,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274067317] [2025-04-29 11:00:34,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274067317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:34,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580608042] [2025-04-29 11:00:34,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:34,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:34,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:34,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:00:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:00:34,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:00:34,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:34,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:34,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:00:34,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:34,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580608042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:34,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-29 11:00:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717789153] [2025-04-29 11:00:34,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:34,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:00:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:34,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:00:34,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:34,757 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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) [2025-04-29 11:00:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:34,806 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2025-04-29 11:00:34,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:00:34,807 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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 24 [2025-04-29 11:00:34,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:34,807 INFO L225 Difference]: With dead ends: 114 [2025-04-29 11:00:34,807 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 11:00:34,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:00:34,808 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:34,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 11:00:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-29 11:00:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 111 states have (on average 1.135135135135135) internal successors, (126), 112 states have internal predecessors, (126), 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) [2025-04-29 11:00:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2025-04-29 11:00:34,818 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 24 [2025-04-29 11:00:34,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:34,819 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2025-04-29 11:00:34,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 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) [2025-04-29 11:00:34,819 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2025-04-29 11:00:34,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:00:34,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:34,822 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:34,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:35,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:35,023 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:35,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1695924876, now seen corresponding path program 2 times [2025-04-29 11:00:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:35,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312106538] [2025-04-29 11:00:35,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:35,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:00:35,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-04-29 11:00:35,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:35,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:35,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312106538] [2025-04-29 11:00:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312106538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:35,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080440615] [2025-04-29 11:00:35,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:35,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:35,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:00:35,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-29 11:00:35,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-04-29 11:00:35,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:35,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:35,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:35,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:35,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080440615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:35,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:00:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183598258] [2025-04-29 11:00:35,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:35,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:35,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:35,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:35,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:35,202 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:00:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:35,217 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2025-04-29 11:00:35,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:35,218 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 38 [2025-04-29 11:00:35,218 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:35,218 INFO L225 Difference]: With dead ends: 113 [2025-04-29 11:00:35,218 INFO L226 Difference]: Without dead ends: 78 [2025-04-29 11:00:35,218 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:00:35,219 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:35,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-29 11:00:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2025-04-29 11:00:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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) [2025-04-29 11:00:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-04-29 11:00:35,222 INFO L79 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 38 [2025-04-29 11:00:35,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:35,222 INFO L485 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-04-29 11:00:35,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-29 11:00:35,222 INFO L278 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-04-29 11:00:35,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 11:00:35,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:00:35,223 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:35,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:00:35,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:35,424 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-04-29 11:00:35,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 712028950, now seen corresponding path program 2 times [2025-04-29 11:00:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:35,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721668542] [2025-04-29 11:00:35,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:35,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:00:35,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 42 statements. [2025-04-29 11:00:35,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:35,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-04-29 11:00:35,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:35,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721668542] [2025-04-29 11:00:35,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721668542] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:35,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003922452] [2025-04-29 11:00:35,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:35,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:35,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:35,454 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:35,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:00:35,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:00:35,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 42 statements. [2025-04-29 11:00:35,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:35,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:35,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:35,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-04-29 11:00:35,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-04-29 11:00:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003922452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:35,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:35,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:00:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920373110] [2025-04-29 11:00:35,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:35,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:35,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:35,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:35,582 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2025-04-29 11:00:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:00:35,595 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-04-29 11:00:35,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:35,595 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 42 [2025-04-29 11:00:35,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:00:35,596 INFO L225 Difference]: With dead ends: 49 [2025-04-29 11:00:35,596 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:00:35,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:00:35,596 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:00:35,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:00:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:00:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:00:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:00:35,597 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-04-29 11:00:35,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:00:35,597 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:00:35,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2025-04-29 11:00:35,597 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:00:35,597 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:00:35,599 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-04-29 11:00:35,599 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-04-29 11:00:35,600 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-04-29 11:00:35,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:00:35,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:00:35,803 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:35,804 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 11:00:36,069 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:36,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:36 BoogieIcfgContainer [2025-04-29 11:00:36,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:36,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:36,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:36,085 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:36,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:31" (3/4) ... [2025-04-29 11:00:36,087 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:00:36,094 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-04-29 11:00:36,094 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-29 11:00:36,094 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:00:36,094 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:00:36,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:36,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:36,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:36,154 INFO L158 Benchmark]: Toolchain (without parser) took 5276.92ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 141.6MB in the end (delta: 17.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 209.7MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.88ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 145.3MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.94ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: RCFGBuilder took 227.44ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 127.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:36,154 INFO L158 Benchmark]: TraceAbstraction took 4714.78ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 148.8MB in the end (delta: -22.0MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2025-04-29 11:00:36,155 INFO L158 Benchmark]: Witness Printer took 68.89ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 141.6MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:36,155 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.21ms. Allocated memory is still 209.7MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.88ms. Allocated memory is still 201.3MB. Free memory was 159.2MB in the beginning and 145.3MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.94ms. Allocated memory is still 201.3MB. Free memory was 145.3MB in the beginning and 143.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 201.3MB. Free memory was 143.5MB in the beginning and 141.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 227.44ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 127.3MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4714.78ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 148.8MB in the end (delta: -22.0MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 68.89ms. Allocated memory is still 201.3MB. Free memory was 147.0MB in the beginning and 141.6MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 42 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 788 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 410 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 231 mSDtfsCounter, 410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 425 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 1427 SizeOfPredicates, 4 NumberOfNonLiveVariables, 661 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 903/1221 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || (((((1 <= length1) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= i)) && (length2 <= 2147483647))) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((((i == 0) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647)) || (((((1 <= i) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (length2 <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-04-29 11:00:36,166 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 Result: TRUE