./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.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/ldv-memsafety/memleaks_test18_2.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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:23:03,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:23:03,949 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:23:03,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:23:03,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:23:03,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:23:03,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:23:03,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:23:03,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:23:03,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:23:03,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:23:03,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:23:03,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:23:03,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:23:03,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:23:03,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:23:03,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:23:03,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:23:03,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:23:03,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:23:03,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:23:03,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:23:03,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:23:03,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:23:03,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:23:03,986 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:23:03,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:23:03,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:23:03,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:23:03,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:23:03,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:23:03,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:23:03,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:23:03,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:23:03,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:23:03,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:23:03,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:23:03,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:23:03,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:23:03,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:23:03,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:23:03,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:23:03,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:23:03,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:23:03,991 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2024-10-11 20:23:04,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:23:04,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:23:04,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:23:04,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:23:04,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:23:04,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-10-11 20:23:05,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:23:05,978 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:23:05,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-10-11 20:23:05,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/325e3c4ba/7af8d7a03c3c437bb433f2c4f5745a37/FLAG8c0df8bb4 [2024-10-11 20:23:06,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/325e3c4ba/7af8d7a03c3c437bb433f2c4f5745a37 [2024-10-11 20:23:06,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:23:06,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:23:06,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:23:06,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:23:06,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:23:06,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320edfa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06, skipping insertion in model container [2024-10-11 20:23:06,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:23:06,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:23:06,496 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:23:06,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:23:06,592 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:23:06,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06 WrapperNode [2024-10-11 20:23:06,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:23:06,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:23:06,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:23:06,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:23:06,601 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:23:06" (1/1) ... [2024-10-11 20:23:06,617 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:23:06" (1/1) ... [2024-10-11 20:23:06,634 INFO L138 Inliner]: procedures = 164, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 52 [2024-10-11 20:23:06,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:23:06,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:23:06,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:23:06,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:23:06,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,678 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 20:23:06,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:23:06,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:23:06,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:23:06,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:23:06,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (1/1) ... [2024-10-11 20:23:06,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:23:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:06,745 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:23:06,747 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:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 20:23:06,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:23:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:23:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 20:23:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 20:23:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:23:06,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:23:06,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:23:06,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:23:06,993 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 20:23:06,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:23:07,018 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:23:07,019 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:23:07,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:07 BoogieIcfgContainer [2024-10-11 20:23:07,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:23:07,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:23:07,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:23:07,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:23:07,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:23:06" (1/3) ... [2024-10-11 20:23:07,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56967720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:07, skipping insertion in model container [2024-10-11 20:23:07,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:06" (2/3) ... [2024-10-11 20:23:07,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56967720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:07, skipping insertion in model container [2024-10-11 20:23:07,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:07" (3/3) ... [2024-10-11 20:23:07,027 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2024-10-11 20:23:07,043 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:23:07,044 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:23:07,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:23:07,113 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;@6ecedf4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:23:07,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:23:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:23:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:23:07,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:07,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:07,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:07,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1600399208, now seen corresponding path program 1 times [2024-10-11 20:23:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613551656] [2024-10-11 20:23:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:07,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:23:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613551656] [2024-10-11 20:23:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613551656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:23:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:23:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896267288] [2024-10-11 20:23:07,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:07,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:23:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:23:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:23:07,753 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:23:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:07,856 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-11 20:23:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:23:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 20:23:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:07,867 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:23:07,867 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 20:23:07,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:23:07,876 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:07,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 20:23:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-11 20:23:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:23:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-11 20:23:07,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2024-10-11 20:23:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:07,907 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-11 20:23:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:23:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-11 20:23:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:23:07,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:07,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:23:07,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 897901737, now seen corresponding path program 1 times [2024-10-11 20:23:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240957904] [2024-10-11 20:23:07,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,117 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:23:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:08,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240957904] [2024-10-11 20:23:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240957904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:23:08,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:23:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126601867] [2024-10-11 20:23:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:23:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:23:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:23:08,124 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:23:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:08,181 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-10-11 20:23:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:23:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-11 20:23:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:08,185 INFO L225 Difference]: With dead ends: 50 [2024-10-11 20:23:08,185 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 20:23:08,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:23:08,187 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:08,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:23:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 20:23:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 20:23:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:23:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-11 20:23:08,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 20 [2024-10-11 20:23:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:08,201 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-11 20:23:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:23:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-11 20:23:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:23:08,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:08,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:08,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:23:08,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:08,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -909552726, now seen corresponding path program 1 times [2024-10-11 20:23:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369652359] [2024-10-11 20:23:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:23:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369652359] [2024-10-11 20:23:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369652359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:08,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:23:08,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:23:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144213418] [2024-10-11 20:23:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:23:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:23:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:23:08,292 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:23:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:08,354 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-10-11 20:23:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:23:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 20:23:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:08,355 INFO L225 Difference]: With dead ends: 45 [2024-10-11 20:23:08,355 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 20:23:08,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:23:08,357 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:08,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 20:23:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-11 20:23:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:23:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-11 20:23:08,363 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2024-10-11 20:23:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:08,363 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-11 20:23:08,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:23:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-11 20:23:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:23:08,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:08,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:08,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:23:08,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:08,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -403799982, now seen corresponding path program 1 times [2024-10-11 20:23:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962442500] [2024-10-11 20:23:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:08,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962442500] [2024-10-11 20:23:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962442500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259318853] [2024-10-11 20:23:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:08,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:08,551 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:23:08,553 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:23:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:08,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:23:08,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:08,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:23:08,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259318853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:08,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:23:08,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-10-11 20:23:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222309229] [2024-10-11 20:23:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:08,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:23:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:23:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:23:08,738 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:23:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:08,782 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-11 20:23:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:23:08,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-11 20:23:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:08,783 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:23:08,783 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 20:23:08,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:23:08,785 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:08,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:23:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 20:23:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 20:23:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.25) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:23:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-11 20:23:08,797 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 27 [2024-10-11 20:23:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:08,797 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-11 20:23:08,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:23:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-11 20:23:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:23:08,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:08,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:08,820 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:23:09,002 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:23:09,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:09,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 367102512, now seen corresponding path program 1 times [2024-10-11 20:23:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762697033] [2024-10-11 20:23:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762697033] [2024-10-11 20:23:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762697033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931236796] [2024-10-11 20:23:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:09,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:09,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:09,113 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:23:09,120 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:23:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:23:09,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:09,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:23:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931236796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:23:09,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:23:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-11 20:23:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562073795] [2024-10-11 20:23:09,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:23:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:23:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:23:09,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:23:09,338 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:23:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:09,425 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-10-11 20:23:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:23:09,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2024-10-11 20:23:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:09,429 INFO L225 Difference]: With dead ends: 65 [2024-10-11 20:23:09,430 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 20:23:09,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:23:09,431 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:09,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 20:23:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-10-11 20:23:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 20:23:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-10-11 20:23:09,448 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 28 [2024-10-11 20:23:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:09,448 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-10-11 20:23:09,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:23:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-10-11 20:23:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:23:09,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:09,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:23:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:09,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:09,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1250567760, now seen corresponding path program 1 times [2024-10-11 20:23:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99196390] [2024-10-11 20:23:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:23:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:09,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99196390] [2024-10-11 20:23:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99196390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:23:09,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:23:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:23:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95781609] [2024-10-11 20:23:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:23:09,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:23:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:23:09,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:23:09,762 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:23:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:09,791 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2024-10-11 20:23:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:23:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-11 20:23:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:09,794 INFO L225 Difference]: With dead ends: 59 [2024-10-11 20:23:09,794 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 20:23:09,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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:23:09,795 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:09,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:23:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 20:23:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 20:23:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 46 states have internal predecessors, (55), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 20:23:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2024-10-11 20:23:09,808 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 30 [2024-10-11 20:23:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2024-10-11 20:23:09,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:23:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2024-10-11 20:23:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:23:09,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:09,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:23:09,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -112894808, now seen corresponding path program 1 times [2024-10-11 20:23:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961368802] [2024-10-11 20:23:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:09,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961368802] [2024-10-11 20:23:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961368802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995808545] [2024-10-11 20:23:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:09,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:09,972 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:23:09,973 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:23:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:23:10,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:10,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:23:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:23:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995808545] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:23:10,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:23:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-10-11 20:23:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806647999] [2024-10-11 20:23:10,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:23:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:23:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:23:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:23:10,213 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:23:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:10,300 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2024-10-11 20:23:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:23:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-10-11 20:23:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:10,302 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:23:10,302 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 20:23:10,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:23:10,303 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:10,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 20:23:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2024-10-11 20:23:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:23:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-11 20:23:10,310 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 31 [2024-10-11 20:23:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:10,311 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-11 20:23:10,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:23:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-11 20:23:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 20:23:10,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:10,312 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:10,331 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:23:10,513 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:23:10,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:10,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1983830978, now seen corresponding path program 2 times [2024-10-11 20:23:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:10,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996966414] [2024-10-11 20:23:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:23:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:23:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:23:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:23:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996966414] [2024-10-11 20:23:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996966414] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999095576] [2024-10-11 20:23:10,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:23:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:10,813 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:23:10,815 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:23:10,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:23:10,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:23:10,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:23:10,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:23:10,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:23:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 20:23:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999095576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:23:11,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:23:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-10-11 20:23:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123161134] [2024-10-11 20:23:11,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:23:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:23:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:23:11,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:23:11,217 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:23:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:11,354 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2024-10-11 20:23:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 20:23:11,354 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 58 [2024-10-11 20:23:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:11,355 INFO L225 Difference]: With dead ends: 78 [2024-10-11 20:23:11,355 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 20:23:11,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:23:11,356 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:11,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:23:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 20:23:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-11 20:23:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:23:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2024-10-11 20:23:11,373 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 58 [2024-10-11 20:23:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:11,374 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2024-10-11 20:23:11,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 12 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 20:23:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2024-10-11 20:23:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 20:23:11,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:23:11,377 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:11,396 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:23:11,581 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:23:11,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:23:11,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:23:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1739979878, now seen corresponding path program 3 times [2024-10-11 20:23:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:23:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504496173] [2024-10-11 20:23:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:23:11,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:23:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:23:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 20:23:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 20:23:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 20:23:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:23:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 20:23:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:23:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 20:23:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 20:23:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 20:23:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:23:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:23:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:23:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 275 proven. 55 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 20:23:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:23:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504496173] [2024-10-11 20:23:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504496173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:23:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721285384] [2024-10-11 20:23:12,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 20:23:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:23:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:23:12,407 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:23:12,408 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:23:12,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 20:23:12,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:23:12,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:23:12,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:23:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 20:23:12,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:23:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 20:23:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721285384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:23:12,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:23:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 4] total 30 [2024-10-11 20:23:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582901965] [2024-10-11 20:23:12,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:23:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 20:23:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:23:12,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 20:23:12,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-10-11 20:23:12,888 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-11 20:23:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:23:13,543 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-10-11 20:23:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 20:23:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) Word has length 118 [2024-10-11 20:23:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:23:13,544 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:23:13,544 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:23:13,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 20:23:13,547 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:23:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 347 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:23:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:23:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:23:13,547 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:23:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:23:13,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2024-10-11 20:23:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:23:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:23:13,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 15 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-11 20:23:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:23:13,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:23:13,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 20:23:13,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 20:23:13,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 20:23:13,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 20:23:13,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 20:23:13,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 20:23:13,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:23:13,755 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:23:13,759 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2024-10-11 20:23:13,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:23:13,957 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:23:13,972 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 20:23:13,977 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-10-11 20:23:13,978 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 20:23:13,978 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 20:23:13,978 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 20:23:13,978 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 20:23:13,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:23:13 BoogieIcfgContainer [2024-10-11 20:23:13,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:23:13,979 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:23:13,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:23:13,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:23:13,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:07" (3/4) ... [2024-10-11 20:23:13,981 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:23:13,984 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 20:23:13,988 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 20:23:13,988 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 20:23:13,988 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:23:14,100 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:23:14,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:23:14,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:23:14,102 INFO L158 Benchmark]: Toolchain (without parser) took 8089.60ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 70.5MB in the beginning and 177.2MB in the end (delta: -106.7MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,102 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 100.7MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:23:14,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.59ms. Allocated memory is still 140.5MB. Free memory was 70.4MB in the beginning and 92.4MB in the end (delta: -22.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.68ms. Allocated memory is still 140.5MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,103 INFO L158 Benchmark]: Boogie Preprocessor took 69.59ms. Allocated memory is still 140.5MB. Free memory was 90.3MB in the beginning and 87.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,103 INFO L158 Benchmark]: RCFGBuilder took 314.59ms. Allocated memory is still 140.5MB. Free memory was 87.9MB in the beginning and 74.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,103 INFO L158 Benchmark]: TraceAbstraction took 6957.00ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 73.2MB in the beginning and 65.6MB in the end (delta: 7.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,104 INFO L158 Benchmark]: Witness Printer took 122.57ms. Allocated memory is still 209.7MB. Free memory was 65.6MB in the beginning and 177.2MB in the end (delta: -111.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-11 20:23:14,105 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.96ms. Allocated memory is still 100.7MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.59ms. Allocated memory is still 140.5MB. Free memory was 70.4MB in the beginning and 92.4MB in the end (delta: -22.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.68ms. Allocated memory is still 140.5MB. Free memory was 92.4MB in the beginning and 90.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.59ms. Allocated memory is still 140.5MB. Free memory was 90.3MB in the beginning and 87.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.59ms. Allocated memory is still 140.5MB. Free memory was 87.9MB in the beginning and 74.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6957.00ms. Allocated memory was 140.5MB in the beginning and 209.7MB in the end (delta: 69.2MB). Free memory was 73.2MB in the beginning and 65.6MB in the end (delta: 7.6MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 122.57ms. Allocated memory is still 209.7MB. Free memory was 65.6MB in the beginning and 177.2MB in the end (delta: -111.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 774]: 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, 28 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 1056 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 971 IncrementalHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 212 mSDtfsCounter, 971 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=8, InterpolantAutomatonStates: 105, 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, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 611 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 2036 SizeOfPredicates, 2 NumberOfNonLiveVariables, 911 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1936/2306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (j < 2147483649) - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((((i <= 2147483646) && (len <= 10)) && (1 <= i)) || ((len <= 10) && (i == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:23:14,130 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