./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:22:20,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:22:20,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:22:20,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:22:20,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:22:20,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:22:20,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:22:20,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:22:20,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:22:20,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:22:20,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:22:20,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:22:20,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:22:20,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:22:20,817 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:22:20,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:22:20,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:22:20,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:22:20,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:22:20,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:22:20,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:22:20,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:22:20,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:22:20,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:22:20,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:22:20,820 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:22:20,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:22:20,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:22:20,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:22:20,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:22:20,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:22:20,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:22:20,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:22:20,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:22:20,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:20,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:22:20,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:22:20,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:22:20,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:22:20,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:22:20,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:22:20,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:22:20,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:22:20,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:22:20,827 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-clean/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-clean/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 -> 79d8454f49f42d774b494771accf13f0b47382db45ac5cfdb4c7afee633f8cd7 [2024-10-11 20:22:21,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:22:21,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:22:21,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:22:21,103 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:22:21,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:22:21,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-10-11 20:22:22,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:22:22,749 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:22:22,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2024-10-11 20:22:22,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7fc54f863/4cb0aac4b2ac481085bf9d0b2009c82b/FLAG222487ede [2024-10-11 20:22:23,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7fc54f863/4cb0aac4b2ac481085bf9d0b2009c82b [2024-10-11 20:22:23,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:22:23,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:22:23,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:23,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:22:23,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:22:23,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b0c096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23, skipping insertion in model container [2024-10-11 20:22:23,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:22:23,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:23,492 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:22:23,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:22:23,553 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:22:23,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23 WrapperNode [2024-10-11 20:22:23,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:22:23,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:23,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:22:23,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:22:23,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,610 INFO L138 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-10-11 20:22:23,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:22:23,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:22:23,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:22:23,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:22:23,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,641 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-11 20:22:23,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:22:23,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:22:23,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:22:23,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:22:23,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (1/1) ... [2024-10-11 20:22:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:22:23,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:23,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:22:23,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:22:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 20:22:23,753 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 20:22:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:22:23,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:22:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:22:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:22:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:22:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:22:23,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:22:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:22:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:22:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:22:23,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:22:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:22:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:22:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:22:23,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:22:23,876 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:22:23,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:22:23,904 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 20:22:24,057 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 20:22:24,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:22:24,083 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:22:24,083 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:22:24,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:24 BoogieIcfgContainer [2024-10-11 20:22:24,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:22:24,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:22:24,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:22:24,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:22:24,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:22:23" (1/3) ... [2024-10-11 20:22:24,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76306c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:24, skipping insertion in model container [2024-10-11 20:22:24,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:22:23" (2/3) ... [2024-10-11 20:22:24,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76306c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:22:24, skipping insertion in model container [2024-10-11 20:22:24,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:24" (3/3) ... [2024-10-11 20:22:24,096 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2024-10-11 20:22:24,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:22:24,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:22:24,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:22:24,168 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;@782bfbac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:22:24,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:22:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:22:24,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:24,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:24,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:24,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1964106767, now seen corresponding path program 1 times [2024-10-11 20:22:24,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485812381] [2024-10-11 20:22:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:24,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485812381] [2024-10-11 20:22:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485812381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:22:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642848231] [2024-10-11 20:22:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:24,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:24,570 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 28 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:24,646 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2024-10-11 20:22:24,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:24,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:22:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:24,655 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:22:24,655 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:22:24,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:24,661 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:24,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:22:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-10-11 20:22:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-11 20:22:24,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2024-10-11 20:22:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:24,692 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-11 20:22:24,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-11 20:22:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:22:24,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:24,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:24,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:22:24,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2063445653, now seen corresponding path program 1 times [2024-10-11 20:22:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869397826] [2024-10-11 20:22:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:24,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869397826] [2024-10-11 20:22:24,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869397826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:24,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:24,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:22:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912097525] [2024-10-11 20:22:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:24,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:22:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:22:24,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:24,811 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:24,860 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-11 20:22:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:22:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:24,864 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:22:24,864 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:22:24,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:22:24,866 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:24,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:22:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-11 20:22:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-11 20:22:24,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2024-10-11 20:22:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:24,873 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-11 20:22:24,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-11 20:22:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:22:24,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:24,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:22:24,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1096626415, now seen corresponding path program 1 times [2024-10-11 20:22:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475543440] [2024-10-11 20:22:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:22:25,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475543440] [2024-10-11 20:22:25,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475543440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:22:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020513914] [2024-10-11 20:22:25,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:25,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:25,160 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:25,251 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-10-11 20:22:25,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:22:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:25,253 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:22:25,253 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:22:25,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:22:25,255 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:25,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:22:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 20:22:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-10-11 20:22:25,260 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2024-10-11 20:22:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:25,260 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-10-11 20:22:25,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-10-11 20:22:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 20:22:25,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:25,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:22:25,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:25,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash -435579901, now seen corresponding path program 1 times [2024-10-11 20:22:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444093133] [2024-10-11 20:22:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444093133] [2024-10-11 20:22:25,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444093133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:25,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577849638] [2024-10-11 20:22:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:25,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:25,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:25,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:25,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:22:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:25,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:22:25,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:22:25,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577849638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:25,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:22:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005113296] [2024-10-11 20:22:25,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:22:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:22:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:22:25,623 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:25,682 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-10-11 20:22:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:22:25,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 20:22:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:25,684 INFO L225 Difference]: With dead ends: 32 [2024-10-11 20:22:25,684 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 20:22:25,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-10-11 20:22:25,685 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:25,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 20:22:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 20:22:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-10-11 20:22:25,694 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2024-10-11 20:22:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:25,694 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-10-11 20:22:25,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-10-11 20:22:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:22:25,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:25,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:22:25,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:22:25,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:25,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash -618074970, now seen corresponding path program 1 times [2024-10-11 20:22:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936343483] [2024-10-11 20:22:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:22:25,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936343483] [2024-10-11 20:22:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936343483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:25,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:22:25,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:22:25,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715589204] [2024-10-11 20:22:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:25,988 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:26,022 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-10-11 20:22:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:22:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 20:22:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:26,023 INFO L225 Difference]: With dead ends: 33 [2024-10-11 20:22:26,023 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:22:26,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:22:26,024 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:26,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:22:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-10-11 20:22:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-11 20:22:26,032 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2024-10-11 20:22:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:26,033 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-11 20:22:26,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-11 20:22:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:22:26,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:26,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:22:26,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 482336925, now seen corresponding path program 1 times [2024-10-11 20:22:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254071352] [2024-10-11 20:22:26,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254071352] [2024-10-11 20:22:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254071352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:26,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128655695] [2024-10-11 20:22:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:26,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:26,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:26,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:22:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:26,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:22:26,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:26,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:22:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128655695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:22:26,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:22:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-11 20:22:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937274604] [2024-10-11 20:22:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:22:26,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:22:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:22:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:22:26,295 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:26,331 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-10-11 20:22:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:22:26,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 20:22:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:26,332 INFO L225 Difference]: With dead ends: 28 [2024-10-11 20:22:26,332 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:22:26,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:22:26,333 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:26,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:22:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-10-11 20:22:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 20:22:26,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2024-10-11 20:22:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 20:22:26,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 20:22:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:22:26,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:26,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:26,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:22:26,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:26,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:26,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2067542893, now seen corresponding path program 1 times [2024-10-11 20:22:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967496347] [2024-10-11 20:22:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967496347] [2024-10-11 20:22:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967496347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:26,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823615564] [2024-10-11 20:22:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:26,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:26,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:26,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:22:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:26,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:22:26,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:26,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823615564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:26,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:22:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415720655] [2024-10-11 20:22:26,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:22:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:26,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:22:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:22:26,830 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:26,873 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-11 20:22:26,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:22:26,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 20:22:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:26,875 INFO L225 Difference]: With dead ends: 43 [2024-10-11 20:22:26,875 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 20:22:26,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:22:26,876 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:26,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:22:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 20:22:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-11 20:22:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-11 20:22:26,880 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2024-10-11 20:22:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:26,881 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-11 20:22:26,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-11 20:22:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:22:26,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:26,882 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:26,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:22:27,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:27,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 259066637, now seen corresponding path program 2 times [2024-10-11 20:22:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322241393] [2024-10-11 20:22:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322241393] [2024-10-11 20:22:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322241393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105523869] [2024-10-11 20:22:27,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:22:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:27,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:22:27,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:22:27,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:27,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:22:27,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:27,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105523869] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:27,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:27,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-10-11 20:22:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358332269] [2024-10-11 20:22:27,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:27,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 20:22:27,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 20:22:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:22:27,694 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:27,765 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-10-11 20:22:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 20:22:27,765 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 20:22:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:27,768 INFO L225 Difference]: With dead ends: 73 [2024-10-11 20:22:27,768 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 20:22:27,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-11 20:22:27,769 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:27,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 20:22:27,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-11 20:22:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-10-11 20:22:27,780 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 39 [2024-10-11 20:22:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:27,782 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-10-11 20:22:27,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-10-11 20:22:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 20:22:27,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:22:27,784 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:27,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:22:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:22:27,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:22:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:22:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1545453325, now seen corresponding path program 3 times [2024-10-11 20:22:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:22:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157107024] [2024-10-11 20:22:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:22:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:22:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:22:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:22:28,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:22:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157107024] [2024-10-11 20:22:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157107024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:22:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331058374] [2024-10-11 20:22:28,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:22:28,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:28,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:22:28,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:22:28,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:22:28,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 20:22:28,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:22:28,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 20:22:28,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:22:28,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 20:22:28,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 20:22:28,777 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 20:22:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 20:22:28,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 20:22:28,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 20:22:28,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 20:22:28,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 20:22:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-11 20:22:28,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:22:29,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:22:29,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2024-10-11 20:22:29,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 20:22:29,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2024-10-11 20:22:29,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-11 20:22:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-11 20:22:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331058374] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:22:29,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:22:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 7, 7] total 36 [2024-10-11 20:22:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938674727] [2024-10-11 20:22:29,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:22:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 20:22:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:22:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 20:22:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1055, Unknown=4, NotChecked=0, Total=1260 [2024-10-11 20:22:29,356 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:29,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:22:29,642 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-10-11 20:22:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:22:29,643 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 20:22:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:22:29,643 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:22:29,643 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:22:29,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=1358, Unknown=4, NotChecked=0, Total=1640 [2024-10-11 20:22:29,645 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:22:29,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 84 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:22:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:22:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:22:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:22:29,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-10-11 20:22:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:22:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:22:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 36 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:22:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:22:29,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:22:29,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:22:29,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:22:29,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:22:29,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:22:29,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:22:29,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:22:29,859 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:22:29,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:22:29,912 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:22:29,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2024-10-11 20:22:29,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!offset [2024-10-11 20:22:29,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 20:22:29,923 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 20:22:29,925 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~p~0!base,]]] [2024-10-11 20:22:29,925 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!base [2024-10-11 20:22:29,926 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!base [2024-10-11 20:22:29,926 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!base [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!base [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!offset [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!offset [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a~0!base [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!base [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 20:22:29,927 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-10-11 20:22:29,928 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-11 20:22:29,928 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-11 20:22:29,928 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] [2024-10-11 20:22:29,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:22:29 BoogieIcfgContainer [2024-10-11 20:22:29,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:22:29,933 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:22:29,933 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:22:29,933 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:22:29,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:22:24" (3/4) ... [2024-10-11 20:22:29,935 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:22:29,938 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2024-10-11 20:22:29,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-11 20:22:29,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:22:29,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:22:29,943 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:22:30,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:22:30,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:22:30,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:22:30,030 INFO L158 Benchmark]: Toolchain (without parser) took 6956.43ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 109.3MB in the beginning and 125.3MB in the end (delta: -16.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,030 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:22:30,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.86ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 130.6MB in the end (delta: -21.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.88ms. Allocated memory is still 165.7MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,031 INFO L158 Benchmark]: Boogie Preprocessor took 42.66ms. Allocated memory is still 165.7MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,032 INFO L158 Benchmark]: RCFGBuilder took 428.17ms. Allocated memory is still 165.7MB. Free memory was 126.4MB in the beginning and 110.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,032 INFO L158 Benchmark]: TraceAbstraction took 5846.22ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 109.7MB in the beginning and 130.6MB in the end (delta: -20.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,032 INFO L158 Benchmark]: Witness Printer took 97.13ms. Allocated memory is still 205.5MB. Free memory was 130.6MB in the beginning and 125.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:22:30,034 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.93ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.86ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 130.6MB in the end (delta: -21.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.88ms. Allocated memory is still 165.7MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.66ms. Allocated memory is still 165.7MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.17ms. Allocated memory is still 165.7MB. Free memory was 126.4MB in the beginning and 110.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5846.22ms. Allocated memory was 165.7MB in the beginning and 205.5MB in the end (delta: 39.8MB). Free memory was 109.7MB in the beginning and 130.6MB in the end (delta: -20.9MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 97.13ms. Allocated memory is still 205.5MB. Free memory was 130.6MB in the beginning and 125.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~p~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~a~0!base,]]] * 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: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 123 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=8, InterpolantAutomatonStates: 69, 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, 9 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 395 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 510 ConstructedInterpolants, 11 QuantifiedInterpolants, 1450 SizeOfPredicates, 8 NumberOfNonLiveVariables, 802 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 598/1054 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (i == 0) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: ((i == 0) || (1 <= i)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:22:30,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE