./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 19:11:34,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 19:11:34,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 19:11:34,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 19:11:34,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 19:11:34,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 19:11:34,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 19:11:34,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 19:11:34,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 19:11:34,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 19:11:34,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 19:11:34,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 19:11:34,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 19:11:34,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 19:11:34,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 19:11:34,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 19:11:34,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 19:11:34,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 19:11:34,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 19:11:34,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 19:11:34,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 19:11:34,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 19:11:34,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 19:11:34,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 19:11:34,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 19:11:34,944 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 19:11:34,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 19:11:34,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 19:11:34,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 19:11:34,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 19:11:34,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 19:11:34,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 19:11:34,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 19:11:34,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 19:11:34,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:34,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 19:11:34,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 19:11:34,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 19:11:34,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 19:11:34,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 19:11:34,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 19:11:34,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 19:11:34,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 19:11:34,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 19:11:34,949 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2024-11-20 19:11:35,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 19:11:35,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 19:11:35,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 19:11:35,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 19:11:35,185 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 19:11:35,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-20 19:11:36,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 19:11:36,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 19:11:36,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-11-20 19:11:36,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121a8b808/65a5ddecf2e94823a1831c3aea9d9ebc/FLAGcbac43cd0 [2024-11-20 19:11:36,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121a8b808/65a5ddecf2e94823a1831c3aea9d9ebc [2024-11-20 19:11:36,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 19:11:36,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 19:11:36,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:36,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 19:11:36,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 19:11:36,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:36,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ea3caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36, skipping insertion in model container [2024-11-20 19:11:36,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:36,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 19:11:36,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:36,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 19:11:36,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 19:11:36,968 INFO L204 MainTranslator]: Completed translation [2024-11-20 19:11:36,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36 WrapperNode [2024-11-20 19:11:36,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 19:11:36,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:36,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 19:11:36,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 19:11:36,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:36,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:36,998 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 33 [2024-11-20 19:11:36,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 19:11:36,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 19:11:37,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 19:11:37,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 19:11:37,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,021 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-20 19:11:37,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 19:11:37,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 19:11:37,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 19:11:37,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 19:11:37,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (1/1) ... [2024-11-20 19:11:37,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 19:11:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:37,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 19:11:37,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 19:11:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 19:11:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 19:11:37,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 19:11:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 19:11:37,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 19:11:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-20 19:11:37,178 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-20 19:11:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 19:11:37,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 19:11:37,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 19:11:37,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 19:11:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 19:11:37,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 19:11:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 19:11:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 19:11:37,276 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 19:11:37,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 19:11:37,453 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-20 19:11:37,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 19:11:37,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 19:11:37,470 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 19:11:37,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:37 BoogieIcfgContainer [2024-11-20 19:11:37,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 19:11:37,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 19:11:37,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 19:11:37,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 19:11:37,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:11:36" (1/3) ... [2024-11-20 19:11:37,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee42d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:37, skipping insertion in model container [2024-11-20 19:11:37,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:11:36" (2/3) ... [2024-11-20 19:11:37,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee42d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:11:37, skipping insertion in model container [2024-11-20 19:11:37,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:37" (3/3) ... [2024-11-20 19:11:37,487 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-11-20 19:11:37,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 19:11:37,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-20 19:11:37,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 19:11:37,566 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34f7aa09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 19:11:37,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 19:11:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 19:11:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 19:11:37,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:37,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:37,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:37,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1445398111, now seen corresponding path program 1 times [2024-11-20 19:11:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269535212] [2024-11-20 19:11:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269535212] [2024-11-20 19:11:37,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269535212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:37,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 19:11:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513725694] [2024-11-20 19:11:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 19:11:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 19:11:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:11:37,772 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 34 states have internal predecessors, (38), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:37,793 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2024-11-20 19:11:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 19:11:37,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-20 19:11:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:37,799 INFO L225 Difference]: With dead ends: 84 [2024-11-20 19:11:37,799 INFO L226 Difference]: Without dead ends: 32 [2024-11-20 19:11:37,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 19:11:37,806 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:37,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-20 19:11:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-20 19:11:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-20 19:11:37,841 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 10 [2024-11-20 19:11:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-20 19:11:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-20 19:11:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 19:11:37,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:37,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:37,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 19:11:37,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:37,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1502656413, now seen corresponding path program 1 times [2024-11-20 19:11:37,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076065896] [2024-11-20 19:11:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:37,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076065896] [2024-11-20 19:11:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076065896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 19:11:38,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885230906] [2024-11-20 19:11:38,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:38,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:38,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:38,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:38,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:11:38,123 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:38,151 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-20 19:11:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-20 19:11:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:38,153 INFO L225 Difference]: With dead ends: 32 [2024-11-20 19:11:38,153 INFO L226 Difference]: Without dead ends: 30 [2024-11-20 19:11:38,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:11:38,154 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:38,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-20 19:11:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-20 19:11:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-20 19:11:38,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 10 [2024-11-20 19:11:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:38,163 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-20 19:11:38,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 19:11:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-20 19:11:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 19:11:38,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:38,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:38,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 19:11:38,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:38,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -209049016, now seen corresponding path program 1 times [2024-11-20 19:11:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:38,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191061093] [2024-11-20 19:11:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:38,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191061093] [2024-11-20 19:11:38,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191061093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:38,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:38,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 19:11:38,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400176381] [2024-11-20 19:11:38,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:38,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 19:11:38,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 19:11:38,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 19:11:38,284 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:38,340 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-20 19:11:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 19:11:38,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-20 19:11:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:38,341 INFO L225 Difference]: With dead ends: 45 [2024-11-20 19:11:38,341 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 19:11:38,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 19:11:38,342 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 19:11:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-20 19:11:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-20 19:11:38,356 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 22 [2024-11-20 19:11:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-20 19:11:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-20 19:11:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 19:11:38,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:38,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 19:11:38,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash -209048824, now seen corresponding path program 1 times [2024-11-20 19:11:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:38,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360740890] [2024-11-20 19:11:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360740890] [2024-11-20 19:11:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360740890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:38,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 19:11:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372656701] [2024-11-20 19:11:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:38,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 19:11:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 19:11:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 19:11:38,506 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:38,584 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-20 19:11:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 19:11:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-20 19:11:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:38,586 INFO L225 Difference]: With dead ends: 43 [2024-11-20 19:11:38,587 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 19:11:38,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:38,589 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:38,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 19:11:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-20 19:11:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-20 19:11:38,595 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2024-11-20 19:11:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:38,596 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-20 19:11:38,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-20 19:11:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 19:11:38,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:38,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 19:11:38,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:38,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2109421121, now seen corresponding path program 1 times [2024-11-20 19:11:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314009632] [2024-11-20 19:11:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 19:11:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314009632] [2024-11-20 19:11:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314009632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 19:11:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 19:11:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122554117] [2024-11-20 19:11:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:38,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 19:11:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 19:11:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 19:11:38,709 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:38,755 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-20 19:11:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 19:11:38,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-20 19:11:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:38,757 INFO L225 Difference]: With dead ends: 40 [2024-11-20 19:11:38,757 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 19:11:38,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 19:11:38,759 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:38,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 19:11:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-20 19:11:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-20 19:11:38,767 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 23 [2024-11-20 19:11:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:38,769 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-20 19:11:38,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-20 19:11:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-20 19:11:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 19:11:38,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:38,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:38,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 19:11:38,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:38,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 767373436, now seen corresponding path program 1 times [2024-11-20 19:11:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681132258] [2024-11-20 19:11:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681132258] [2024-11-20 19:11:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681132258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040164025] [2024-11-20 19:11:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:38,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:38,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 19:11:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:38,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 19:11:38,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:39,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 19:11:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040164025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 19:11:39,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 19:11:39,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-20 19:11:39,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279977047] [2024-11-20 19:11:39,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 19:11:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 19:11:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 19:11:39,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 19:11:39,091 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:39,157 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-20 19:11:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 19:11:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-11-20 19:11:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:39,158 INFO L225 Difference]: With dead ends: 40 [2024-11-20 19:11:39,158 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 19:11:39,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-11-20 19:11:39,159 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 126 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 19:11:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 19:11:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-20 19:11:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-20 19:11:39,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 34 [2024-11-20 19:11:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:39,164 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-20 19:11:39,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-20 19:11:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 19:11:39,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:39,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:39,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 19:11:39,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 767373628, now seen corresponding path program 1 times [2024-11-20 19:11:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448509661] [2024-11-20 19:11:39,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:39,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448509661] [2024-11-20 19:11:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448509661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346948417] [2024-11-20 19:11:39,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:39,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:39,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:39,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 19:11:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:39,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 19:11:39,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:39,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346948417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:39,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-20 19:11:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921976703] [2024-11-20 19:11:39,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:39,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 19:11:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 19:11:39,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-20 19:11:39,738 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 19:11:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:39,939 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-20 19:11:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 19:11:39,940 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 34 [2024-11-20 19:11:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:39,941 INFO L225 Difference]: With dead ends: 40 [2024-11-20 19:11:39,941 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 19:11:39,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 19:11:39,942 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:39,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 177 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 19:11:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-20 19:11:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 19:11:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-20 19:11:39,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2024-11-20 19:11:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-20 19:11:39,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 16 states have internal predecessors, (45), 9 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 19:11:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-20 19:11:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 19:11:39,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:39,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:39,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 19:11:40,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 19:11:40,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1981227193, now seen corresponding path program 1 times [2024-11-20 19:11:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291370955] [2024-11-20 19:11:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:40,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291370955] [2024-11-20 19:11:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291370955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208235653] [2024-11-20 19:11:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:40,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:40,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 19:11:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:40,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 19:11:40,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:40,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 19:11:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208235653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:40,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-20 19:11:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435988625] [2024-11-20 19:11:40,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 19:11:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:40,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 19:11:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-20 19:11:40,535 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 19:11:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:40,673 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2024-11-20 19:11:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 19:11:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2024-11-20 19:11:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:40,674 INFO L225 Difference]: With dead ends: 72 [2024-11-20 19:11:40,674 INFO L226 Difference]: Without dead ends: 71 [2024-11-20 19:11:40,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-11-20 19:11:40,675 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 69 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:40,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 183 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-20 19:11:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-20 19:11:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 12 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 19:11:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-11-20 19:11:40,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 35 [2024-11-20 19:11:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:40,689 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-11-20 19:11:40,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 19:11:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-11-20 19:11:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-20 19:11:40,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:40,694 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:40,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 19:11:40,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:40,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -910052309, now seen corresponding path program 2 times [2024-11-20 19:11:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:40,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077919812] [2024-11-20 19:11:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:11:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 19:11:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:41,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077919812] [2024-11-20 19:11:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077919812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:41,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8868696] [2024-11-20 19:11:41,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 19:11:41,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:41,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:41,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 19:11:41,305 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 19:11:41,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 19:11:41,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 19:11:41,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 19:11:41,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-20 19:11:41,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8868696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:41,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:41,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2024-11-20 19:11:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371879328] [2024-11-20 19:11:41,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:41,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 19:11:41,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 19:11:41,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2024-11-20 19:11:41,762 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 19:11:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:42,231 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-20 19:11:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-20 19:11:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 71 [2024-11-20 19:11:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:42,232 INFO L225 Difference]: With dead ends: 138 [2024-11-20 19:11:42,232 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 19:11:42,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=830, Invalid=3202, Unknown=0, NotChecked=0, Total=4032 [2024-11-20 19:11:42,234 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 240 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:42,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 272 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 19:11:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 19:11:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2024-11-20 19:11:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.12) internal successors, (112), 101 states have internal predecessors, (112), 24 states have call successors, (24), 13 states have call predecessors, (24), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 19:11:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2024-11-20 19:11:42,252 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 71 [2024-11-20 19:11:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2024-11-20 19:11:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 24 states have internal predecessors, (78), 12 states have call successors, (23), 12 states have call predecessors, (23), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 19:11:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2024-11-20 19:11:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 19:11:42,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:42,258 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:42,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 19:11:42,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:42,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:42,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1007192077, now seen corresponding path program 3 times [2024-11-20 19:11:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925267943] [2024-11-20 19:11:42,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:42,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:11:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 19:11:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 19:11:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 19:11:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 19:11:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 19:11:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 19:11:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925267943] [2024-11-20 19:11:43,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925267943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:43,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514682643] [2024-11-20 19:11:43,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 19:11:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:43,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:43,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:43,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 19:11:43,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-20 19:11:43,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 19:11:43,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-20 19:11:43,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 19:11:43,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 19:11:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514682643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:44,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:44,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 70 [2024-11-20 19:11:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686707233] [2024-11-20 19:11:44,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-20 19:11:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-20 19:11:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=898, Invalid=4072, Unknown=0, NotChecked=0, Total=4970 [2024-11-20 19:11:44,513 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 19:11:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:11:46,443 INFO L93 Difference]: Finished difference Result 270 states and 326 transitions. [2024-11-20 19:11:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-11-20 19:11:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 143 [2024-11-20 19:11:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:11:46,445 INFO L225 Difference]: With dead ends: 270 [2024-11-20 19:11:46,445 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 19:11:46,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5116 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3662, Invalid=14698, Unknown=0, NotChecked=0, Total=18360 [2024-11-20 19:11:46,448 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 732 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 19:11:46,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 365 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 19:11:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 19:11:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 247. [2024-11-20 19:11:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 197 states have internal predecessors, (220), 48 states have call successors, (48), 25 states have call predecessors, (48), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 19:11:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 292 transitions. [2024-11-20 19:11:46,473 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 292 transitions. Word has length 143 [2024-11-20 19:11:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:11:46,474 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 292 transitions. [2024-11-20 19:11:46,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 2.142857142857143) internal successors, (150), 48 states have internal predecessors, (150), 24 states have call successors, (47), 24 states have call predecessors, (47), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 19:11:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 292 transitions. [2024-11-20 19:11:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-20 19:11:46,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 19:11:46,477 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:11:46,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 19:11:46,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 19:11:46,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 19:11:46,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 19:11:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 594503555, now seen corresponding path program 4 times [2024-11-20 19:11:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 19:11:46,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329286423] [2024-11-20 19:11:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 19:11:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 19:11:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 19:11:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-20 19:11:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 19:11:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 19:11:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 19:11:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 19:11:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 19:11:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 19:11:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 19:11:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 19:11:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 19:11:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 19:11:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-20 19:11:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 19:11:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 19:11:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 19:11:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 19:11:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-20 19:11:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-20 19:11:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-20 19:11:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-20 19:11:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-20 19:11:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-20 19:11:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-20 19:11:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 19:11:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-20 19:11:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 19:11:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329286423] [2024-11-20 19:11:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329286423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 19:11:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587743163] [2024-11-20 19:11:49,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 19:11:49,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:11:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 19:11:49,482 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 19:11:49,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 19:11:49,649 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 19:11:49,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 19:11:49,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-20 19:11:49,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 19:11:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2904 trivial. 0 not checked. [2024-11-20 19:11:49,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 19:11:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2904 trivial. 0 not checked. [2024-11-20 19:11:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587743163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 19:11:50,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 19:11:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 6, 6] total 80 [2024-11-20 19:11:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301432658] [2024-11-20 19:11:50,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 19:11:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-11-20 19:11:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 19:11:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-11-20 19:11:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1015, Invalid=5465, Unknown=0, NotChecked=0, Total=6480 [2024-11-20 19:11:50,418 INFO L87 Difference]: Start difference. First operand 247 states and 292 transitions. Second operand has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 19:12:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 19:12:00,461 INFO L93 Difference]: Finished difference Result 545 states and 643 transitions. [2024-11-20 19:12:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-11-20 19:12:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Word has length 287 [2024-11-20 19:12:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 19:12:00,463 INFO L225 Difference]: With dead ends: 545 [2024-11-20 19:12:00,463 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 19:12:00,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40496 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=21775, Invalid=96217, Unknown=0, NotChecked=0, Total=117992 [2024-11-20 19:12:00,476 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2091 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 19:12:00,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 320 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 19:12:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 19:12:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 19:12:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 19:12:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 19:12:00,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 287 [2024-11-20 19:12:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 19:12:00,477 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 19:12:00,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 2.275) internal successors, (182), 56 states have internal predecessors, (182), 30 states have call successors, (57), 26 states have call predecessors, (57), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 19:12:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 19:12:00,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-20 19:12:00,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-20 19:12:00,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 19:12:00,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 19:12:00,686 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 19:12:00,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 19:12:07,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 19:12:07,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:12:07 BoogieIcfgContainer [2024-11-20 19:12:07,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 19:12:07,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 19:12:07,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 19:12:07,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 19:12:07,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:11:37" (3/4) ... [2024-11-20 19:12:07,250 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 19:12:07,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 19:12:07,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2024-11-20 19:12:07,253 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-20 19:12:07,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-20 19:12:07,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 19:12:07,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 19:12:07,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 19:12:07,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 19:12:07,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 19:12:07,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 19:12:07,325 INFO L158 Benchmark]: Toolchain (without parser) took 30592.73ms. Allocated memory was 155.2MB in the beginning and 985.7MB in the end (delta: 830.5MB). Free memory was 84.7MB in the beginning and 693.5MB in the end (delta: -608.8MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,325 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 155.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 19:12:07,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.53ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 72.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.31ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 70.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,326 INFO L158 Benchmark]: Boogie Preprocessor took 41.40ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 68.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,326 INFO L158 Benchmark]: RCFGBuilder took 425.70ms. Allocated memory was 155.2MB in the beginning and 241.2MB in the end (delta: 86.0MB). Free memory was 68.5MB in the beginning and 203.7MB in the end (delta: -135.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,326 INFO L158 Benchmark]: TraceAbstraction took 29774.04ms. Allocated memory was 241.2MB in the beginning and 985.7MB in the end (delta: 744.5MB). Free memory was 202.6MB in the beginning and 697.7MB in the end (delta: -495.1MB). Peak memory consumption was 445.5MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,326 INFO L158 Benchmark]: Witness Printer took 76.75ms. Allocated memory is still 985.7MB. Free memory was 697.7MB in the beginning and 693.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 19:12:07,327 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.82ms. Allocated memory is still 155.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.53ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 72.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.31ms. Allocated memory is still 155.2MB. Free memory was 71.9MB in the beginning and 70.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.40ms. Allocated memory is still 155.2MB. Free memory was 70.4MB in the beginning and 68.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.70ms. Allocated memory was 155.2MB in the beginning and 241.2MB in the end (delta: 86.0MB). Free memory was 68.5MB in the beginning and 203.7MB in the end (delta: -135.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29774.04ms. Allocated memory was 241.2MB in the beginning and 985.7MB in the end (delta: 744.5MB). Free memory was 202.6MB in the beginning and 697.7MB in the end (delta: -495.1MB). Peak memory consumption was 445.5MB. Max. memory is 16.1GB. * Witness Printer took 76.75ms. Allocated memory is still 985.7MB. Free memory was 697.7MB in the beginning and 693.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3302 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3302 mSDsluCounter, 1909 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1629 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1531 IncrementalHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 280 mSDtfsCounter, 1531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1875 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47053 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 464, 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, 11 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1295 NumberOfCodeBlocks, 1295 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1843 ConstructedInterpolants, 0 QuantifiedInterpolants, 4075 SizeOfPredicates, 49 NumberOfNonLiveVariables, 2473 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 7642/11420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 16]: Procedure Contract for check Derived contract for procedure check. Requires: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) Ensures: ((((1 <= y) && (1 <= x)) && (y <= 2147483646)) || ((y <= 2147483646) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-20 19:12:07,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE