./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:02:58,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:02:58,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:02:58,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:02:58,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:02:58,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:02:58,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:02:58,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:02:58,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:02:58,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:02:58,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:02:58,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:02:58,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:02:58,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:02:58,891 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:02:58,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:02:58,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:02:58,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:02:58,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:02:58,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:02:58,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:02:58,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:02:58,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:02:58,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:02:58,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:02:58,895 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:02:58,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:02:58,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:02:58,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:02:58,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:02:58,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:02:58,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:02:58,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:02:58,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:02:58,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:02:58,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:02:58,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:02:58,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:02:58,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:02:58,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:02:58,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:02:58,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:02:58,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:02:58,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:02:58,900 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-10-14 20:02:59,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:02:59,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:02:59,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:02:59,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:02:59,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:02:59,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-10-14 20:03:00,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:03:00,828 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:03:00,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-10-14 20:03:00,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76688aeea/d81d0147d623404bae72d1a00d668541/FLAGc37c0ad02 [2024-10-14 20:03:00,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76688aeea/d81d0147d623404bae72d1a00d668541 [2024-10-14 20:03:00,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:03:00,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:03:00,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:03:00,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:03:00,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:03:00,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:03:00" (1/1) ... [2024-10-14 20:03:00,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59713011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:00, skipping insertion in model container [2024-10-14 20:03:00,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:03:00" (1/1) ... [2024-10-14 20:03:00,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:03:01,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:03:01,062 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:03:01,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:03:01,120 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:03:01,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01 WrapperNode [2024-10-14 20:03:01,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:03:01,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:03:01,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:03:01,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:03:01,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,171 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2024-10-14 20:03:01,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:03:01,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:03:01,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:03:01,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:03:01,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,215 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-10-14 20:03:01,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:03:01,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:03:01,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:03:01,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:03:01,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (1/1) ... [2024-10-14 20:03:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:03:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:01,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:03:01,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:03:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:03:01,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 20:03:01,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 20:03:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:03:01,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:03:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:03:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 20:03:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 20:03:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:03:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:03:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:03:01,398 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:03:01,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:03:01,697 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-10-14 20:03:01,697 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:03:01,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:03:01,787 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 20:03:01,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:03:01 BoogieIcfgContainer [2024-10-14 20:03:01,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:03:01,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:03:01,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:03:01,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:03:01,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:03:00" (1/3) ... [2024-10-14 20:03:01,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110df494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:03:01, skipping insertion in model container [2024-10-14 20:03:01,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:03:01" (2/3) ... [2024-10-14 20:03:01,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@110df494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:03:01, skipping insertion in model container [2024-10-14 20:03:01,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:03:01" (3/3) ... [2024-10-14 20:03:01,803 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-10-14 20:03:01,824 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:03:01,825 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-14 20:03:01,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:03:01,894 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;@e4d161b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:03:01,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-14 20:03:01,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 89 states have internal predecessors, (113), 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-14 20:03:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 20:03:01,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:01,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 20:03:01,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 274859, now seen corresponding path program 1 times [2024-10-14 20:03:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:01,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384617586] [2024-10-14 20:03:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:01,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384617586] [2024-10-14 20:03:02,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384617586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:02,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:03:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241717938] [2024-10-14 20:03:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:02,233 INFO L87 Difference]: Start difference. First operand has 94 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 89 states have internal predecessors, (113), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-14 20:03:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:02,403 INFO L93 Difference]: Finished difference Result 219 states and 296 transitions. [2024-10-14 20:03:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 20:03:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:02,417 INFO L225 Difference]: With dead ends: 219 [2024-10-14 20:03:02,417 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 20:03:02,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-14 20:03:02,427 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:02,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 233 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:03:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 20:03:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2024-10-14 20:03:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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-14 20:03:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2024-10-14 20:03:02,475 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 3 [2024-10-14 20:03:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2024-10-14 20:03:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-14 20:03:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2024-10-14 20:03:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 20:03:02,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:02,477 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2024-10-14 20:03:02,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:03:02,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -401557255, now seen corresponding path program 1 times [2024-10-14 20:03:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977899770] [2024-10-14 20:03:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977899770] [2024-10-14 20:03:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977899770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429433882] [2024-10-14 20:03:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:02,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:02,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:02,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:02,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 20:03:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:02,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:03:02,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:02,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:03:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429433882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:02,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:03:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-14 20:03:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234003826] [2024-10-14 20:03:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:02,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:03:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:03:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:03:02,747 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-14 20:03:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:02,933 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2024-10-14 20:03:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:03:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 20:03:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:02,935 INFO L225 Difference]: With dead ends: 126 [2024-10-14 20:03:02,937 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 20:03:02,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 20:03:02,938 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 31 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:02,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 338 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:03:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 20:03:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-10-14 20:03:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 96 states have internal predecessors, (110), 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-14 20:03:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2024-10-14 20:03:02,959 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 6 [2024-10-14 20:03:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:02,959 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2024-10-14 20:03:02,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-14 20:03:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2024-10-14 20:03:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:03:02,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:02,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2024-10-14 20:03:02,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:03:03,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:03,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:03,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash 436627029, now seen corresponding path program 1 times [2024-10-14 20:03:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639187831] [2024-10-14 20:03:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:03:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639187831] [2024-10-14 20:03:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639187831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:03:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603278646] [2024-10-14 20:03:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:03:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:03:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:03:03,226 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:03,248 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-10-14 20:03:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:03:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:03:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:03,250 INFO L225 Difference]: With dead ends: 101 [2024-10-14 20:03:03,250 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 20:03:03,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:03:03,251 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:03,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 20:03:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-14 20:03:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 93 states have internal predecessors, (107), 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-14 20:03:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-10-14 20:03:03,264 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 7 [2024-10-14 20:03:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:03,264 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-10-14 20:03:03,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-10-14 20:03:03,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:03:03,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:03,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:03,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:03:03,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:03,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash -175246109, now seen corresponding path program 1 times [2024-10-14 20:03:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:03,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100436405] [2024-10-14 20:03:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:03,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100436405] [2024-10-14 20:03:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100436405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652347753] [2024-10-14 20:03:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:03,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:03,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 20:03:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:03,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:03:03,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:03,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:03:03,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652347753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:03,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-14 20:03:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392014626] [2024-10-14 20:03:03,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 20:03:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 20:03:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:03:03,459 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-14 20:03:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:03,608 INFO L93 Difference]: Finished difference Result 221 states and 258 transitions. [2024-10-14 20:03:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:03:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 20:03:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:03,612 INFO L225 Difference]: With dead ends: 221 [2024-10-14 20:03:03,612 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 20:03:03,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:03:03,615 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:03,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 405 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:03:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 20:03:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2024-10-14 20:03:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.527027027027027) internal successors, (113), 99 states have internal predecessors, (113), 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-14 20:03:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-10-14 20:03:03,629 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 10 [2024-10-14 20:03:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-10-14 20:03:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-14 20:03:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-10-14 20:03:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:03:03,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:03,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:03,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 20:03:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 20:03:03,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash -834308189, now seen corresponding path program 2 times [2024-10-14 20:03:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081471980] [2024-10-14 20:03:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:03:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081471980] [2024-10-14 20:03:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081471980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:03:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835518804] [2024-10-14 20:03:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:03,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:03,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:03,943 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:03,994 INFO L93 Difference]: Finished difference Result 211 states and 244 transitions. [2024-10-14 20:03:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 20:03:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:03,996 INFO L225 Difference]: With dead ends: 211 [2024-10-14 20:03:03,996 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 20:03:03,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:03,998 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:03,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 267 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 20:03:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 108. [2024-10-14 20:03:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.5) internal successors, (117), 103 states have internal predecessors, (117), 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-14 20:03:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-10-14 20:03:04,013 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 16 [2024-10-14 20:03:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-10-14 20:03:04,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-10-14 20:03:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 20:03:04,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:04,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:03:04,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:04,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1411862073, now seen corresponding path program 1 times [2024-10-14 20:03:04,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940225217] [2024-10-14 20:03:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 20:03:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940225217] [2024-10-14 20:03:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940225217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:03:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741237199] [2024-10-14 20:03:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:04,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:04,120 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 20:03:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:04,188 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2024-10-14 20:03:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 20:03:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:04,190 INFO L225 Difference]: With dead ends: 203 [2024-10-14 20:03:04,190 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 20:03:04,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:04,193 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 28 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:04,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 173 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:03:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 20:03:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-10-14 20:03:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 97 states have internal predecessors, (115), 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-14 20:03:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2024-10-14 20:03:04,207 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 18 [2024-10-14 20:03:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2024-10-14 20:03:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 20:03:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2024-10-14 20:03:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 20:03:04,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:04,209 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:03:04,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:04,210 INFO L85 PathProgramCache]: Analyzing trace with hash 100592055, now seen corresponding path program 1 times [2024-10-14 20:03:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145806561] [2024-10-14 20:03:04,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145806561] [2024-10-14 20:03:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145806561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889904316] [2024-10-14 20:03:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:04,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:04,351 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:04,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:03:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:04,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 20:03:04,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:04,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:04,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889904316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:04,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:04,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-10-14 20:03:04,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881546453] [2024-10-14 20:03:04,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:04,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 20:03:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 20:03:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:03:04,579 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-14 20:03:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:04,695 INFO L93 Difference]: Finished difference Result 219 states and 262 transitions. [2024-10-14 20:03:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 20:03:04,696 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 20:03:04,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:04,697 INFO L225 Difference]: With dead ends: 219 [2024-10-14 20:03:04,697 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 20:03:04,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-14 20:03:04,699 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:04,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 234 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:03:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 20:03:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2024-10-14 20:03:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 109 states have internal predecessors, (127), 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-14 20:03:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2024-10-14 20:03:04,708 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 19 [2024-10-14 20:03:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:04,708 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2024-10-14 20:03:04,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 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-14 20:03:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2024-10-14 20:03:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 20:03:04,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:04,712 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:04,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 20:03:04,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:04,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:04,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1876351945, now seen corresponding path program 2 times [2024-10-14 20:03:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476433400] [2024-10-14 20:03:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:04,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476433400] [2024-10-14 20:03:05,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476433400] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073791522] [2024-10-14 20:03:05,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:03:05,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:05,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:05,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:05,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:03:05,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:03:05,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:03:05,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 20:03:05,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:05,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073791522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:05,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2024-10-14 20:03:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708744669] [2024-10-14 20:03:05,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:05,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 20:03:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 20:03:05,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 20:03:05,624 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:05,800 INFO L93 Difference]: Finished difference Result 243 states and 290 transitions. [2024-10-14 20:03:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 20:03:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 20:03:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:05,801 INFO L225 Difference]: With dead ends: 243 [2024-10-14 20:03:05,801 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 20:03:05,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 20:03:05,802 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 80 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:05,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 509 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:03:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 20:03:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2024-10-14 20:03:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 133 states have internal predecessors, (151), 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-14 20:03:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2024-10-14 20:03:05,811 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 31 [2024-10-14 20:03:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2024-10-14 20:03:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2024-10-14 20:03:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 20:03:05,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:05,813 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:05,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:03:06,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:06,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1376934199, now seen corresponding path program 3 times [2024-10-14 20:03:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402335779] [2024-10-14 20:03:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 20:03:06,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402335779] [2024-10-14 20:03:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402335779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243434858] [2024-10-14 20:03:06,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:03:06,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:06,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:06,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:03:06,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 20:03:06,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:03:06,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:03:06,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-14 20:03:06,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:03:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243434858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:03:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [32] total 36 [2024-10-14 20:03:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123776473] [2024-10-14 20:03:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:06,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:03:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:03:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 20:03:06,966 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:07,009 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2024-10-14 20:03:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 20:03:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:07,011 INFO L225 Difference]: With dead ends: 176 [2024-10-14 20:03:07,011 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 20:03:07,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 20:03:07,013 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:07,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 197 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 20:03:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2024-10-14 20:03:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 132 states have internal predecessors, (150), 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-14 20:03:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2024-10-14 20:03:07,025 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 55 [2024-10-14 20:03:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:07,025 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-10-14 20:03:07,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-10-14 20:03:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 20:03:07,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:07,027 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:07,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 20:03:07,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:07,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:07,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash -264712687, now seen corresponding path program 1 times [2024-10-14 20:03:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:07,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517519619] [2024-10-14 20:03:07,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:07,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-10-14 20:03:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517519619] [2024-10-14 20:03:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517519619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:03:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858746528] [2024-10-14 20:03:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:03:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:03:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:03:07,323 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:07,344 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-10-14 20:03:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:03:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 20:03:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:07,346 INFO L225 Difference]: With dead ends: 136 [2024-10-14 20:03:07,346 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 20:03:07,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:03:07,347 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:07,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 20:03:07,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-14 20:03:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.3125) internal successors, (147), 129 states have internal predecessors, (147), 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-14 20:03:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2024-10-14 20:03:07,359 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 56 [2024-10-14 20:03:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2024-10-14 20:03:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2024-10-14 20:03:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 20:03:07,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:07,360 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:07,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:03:07,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1347956560, now seen corresponding path program 1 times [2024-10-14 20:03:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844577174] [2024-10-14 20:03:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-14 20:03:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844577174] [2024-10-14 20:03:07,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844577174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13628015] [2024-10-14 20:03:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:07,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:07,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 20:03:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:07,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 20:03:07,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:03:08,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 20:03:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13628015] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:09,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 32, 32] total 67 [2024-10-14 20:03:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907716293] [2024-10-14 20:03:09,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-14 20:03:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-14 20:03:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-10-14 20:03:09,233 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 67 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 67 states have internal predecessors, (118), 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-14 20:03:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:09,582 INFO L93 Difference]: Finished difference Result 333 states and 398 transitions. [2024-10-14 20:03:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-14 20:03:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 67 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-14 20:03:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:09,585 INFO L225 Difference]: With dead ends: 333 [2024-10-14 20:03:09,585 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 20:03:09,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1099, Invalid=3457, Unknown=0, NotChecked=0, Total=4556 [2024-10-14 20:03:09,588 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 246 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:09,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 583 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:03:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 20:03:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2024-10-14 20:03:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.2147239263803682) internal successors, (198), 180 states have internal predecessors, (198), 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-14 20:03:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2024-10-14 20:03:09,598 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 59 [2024-10-14 20:03:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:09,599 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2024-10-14 20:03:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 67 states have internal predecessors, (118), 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-14 20:03:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2024-10-14 20:03:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 20:03:09,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:09,601 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:09,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 20:03:09,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:09,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1618568988, now seen corresponding path program 2 times [2024-10-14 20:03:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261159191] [2024-10-14 20:03:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 20:03:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261159191] [2024-10-14 20:03:10,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261159191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:10,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:10,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:03:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479282358] [2024-10-14 20:03:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:10,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:10,058 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:10,106 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2024-10-14 20:03:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:10,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-10-14 20:03:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:10,107 INFO L225 Difference]: With dead ends: 261 [2024-10-14 20:03:10,108 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 20:03:10,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:03:10,109 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:10,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 20:03:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-10-14 20:03:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.19375) internal successors, (191), 177 states have internal predecessors, (191), 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-14 20:03:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2024-10-14 20:03:10,116 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 110 [2024-10-14 20:03:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:10,117 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2024-10-14 20:03:10,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:03:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2024-10-14 20:03:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 20:03:10,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:10,118 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:10,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 20:03:10,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash 660898951, now seen corresponding path program 1 times [2024-10-14 20:03:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890135779] [2024-10-14 20:03:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 20:03:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890135779] [2024-10-14 20:03:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890135779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:03:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963281988] [2024-10-14 20:03:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:10,249 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 20:03:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:10,266 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2024-10-14 20:03:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:10,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-14 20:03:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:10,267 INFO L225 Difference]: With dead ends: 183 [2024-10-14 20:03:10,267 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 20:03:10,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-14 20:03:10,269 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:10,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 20:03:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-14 20:03:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 117 states have internal predecessors, (120), 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-14 20:03:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2024-10-14 20:03:10,274 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 112 [2024-10-14 20:03:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:10,275 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2024-10-14 20:03:10,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 20:03:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2024-10-14 20:03:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 20:03:10,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:10,276 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:10,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 20:03:10,277 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:10,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash 718350843, now seen corresponding path program 1 times [2024-10-14 20:03:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:10,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074001110] [2024-10-14 20:03:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:10,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-14 20:03:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074001110] [2024-10-14 20:03:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074001110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:03:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:03:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:03:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124788941] [2024-10-14 20:03:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:03:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:03:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:03:10,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:10,435 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-14 20:03:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:10,461 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2024-10-14 20:03:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:03:10,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-14 20:03:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:10,462 INFO L225 Difference]: With dead ends: 130 [2024-10-14 20:03:10,462 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 20:03:10,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:03:10,463 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:10,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:03:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 20:03:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-14 20:03:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 127 states have internal predecessors, (130), 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-14 20:03:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2024-10-14 20:03:10,469 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 115 [2024-10-14 20:03:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:10,469 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2024-10-14 20:03:10,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-14 20:03:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2024-10-14 20:03:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 20:03:10,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:10,471 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:10,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 20:03:10,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:10,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1982842003, now seen corresponding path program 1 times [2024-10-14 20:03:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:10,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460361961] [2024-10-14 20:03:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460361961] [2024-10-14 20:03:12,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460361961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989791989] [2024-10-14 20:03:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:12,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:12,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:12,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:12,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 20:03:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:12,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-14 20:03:12,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:13,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989791989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:16,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 129 [2024-10-14 20:03:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973734621] [2024-10-14 20:03:16,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:16,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2024-10-14 20:03:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:16,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2024-10-14 20:03:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2024-10-14 20:03:16,139 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 130 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 129 states have internal predecessors, (213), 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-14 20:03:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:16,434 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2024-10-14 20:03:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-10-14 20:03:16,434 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 129 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-10-14 20:03:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:16,435 INFO L225 Difference]: With dead ends: 257 [2024-10-14 20:03:16,436 INFO L226 Difference]: Without dead ends: 224 [2024-10-14 20:03:16,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2024-10-14 20:03:16,440 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:16,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:03:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-14 20:03:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-10-14 20:03:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 1.018018018018018) internal successors, (226), 223 states have internal predecessors, (226), 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-14 20:03:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2024-10-14 20:03:16,451 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 125 [2024-10-14 20:03:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:16,452 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2024-10-14 20:03:16,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 129 states have internal predecessors, (213), 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-14 20:03:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2024-10-14 20:03:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-14 20:03:16,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:16,454 INFO L215 NwaCegarLoop]: trace histogram [63, 63, 63, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:16,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 20:03:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:16,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 47189869, now seen corresponding path program 2 times [2024-10-14 20:03:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508430322] [2024-10-14 20:03:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:03:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:03:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508430322] [2024-10-14 20:03:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508430322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:03:23,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136685093] [2024-10-14 20:03:23,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:03:23,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:03:23,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:03:23,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:03:23,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 20:03:24,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:03:24,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:03:24,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-10-14 20:03:24,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:03:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:24,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:03:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:03:35,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136685093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:03:35,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:03:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 257 [2024-10-14 20:03:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157943608] [2024-10-14 20:03:35,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:03:35,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 258 states [2024-10-14 20:03:35,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:03:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 258 interpolants. [2024-10-14 20:03:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16770, Invalid=49536, Unknown=0, NotChecked=0, Total=66306 [2024-10-14 20:03:35,159 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand has 258 states, 258 states have (on average 1.569767441860465) internal successors, (405), 257 states have internal predecessors, (405), 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-14 20:03:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:03:35,972 INFO L93 Difference]: Finished difference Result 449 states and 516 transitions. [2024-10-14 20:03:35,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2024-10-14 20:03:35,973 INFO L78 Accepts]: Start accepts. Automaton has has 258 states, 258 states have (on average 1.569767441860465) internal successors, (405), 257 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-14 20:03:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:03:35,975 INFO L225 Difference]: With dead ends: 449 [2024-10-14 20:03:35,975 INFO L226 Difference]: Without dead ends: 416 [2024-10-14 20:03:35,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20662 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=16770, Invalid=49536, Unknown=0, NotChecked=0, Total=66306 [2024-10-14 20:03:35,979 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 20:03:35,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 20:03:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-14 20:03:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-14 20:03:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 414 states have (on average 1.0096618357487923) internal successors, (418), 415 states have internal predecessors, (418), 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-14 20:03:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 418 transitions. [2024-10-14 20:03:35,993 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 418 transitions. Word has length 221 [2024-10-14 20:03:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:03:35,994 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 418 transitions. [2024-10-14 20:03:35,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 258 states, 258 states have (on average 1.569767441860465) internal successors, (405), 257 states have internal predecessors, (405), 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-14 20:03:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 418 transitions. [2024-10-14 20:03:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-14 20:03:35,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:03:35,999 INFO L215 NwaCegarLoop]: trace histogram [127, 127, 127, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:03:36,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 20:03:36,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 20:03:36,200 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:03:36,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:03:36,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1107314835, now seen corresponding path program 3 times [2024-10-14 20:03:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:03:36,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365788328] [2024-10-14 20:03:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:03:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:03:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:04:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24144 backedges. 0 proven. 24130 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 20:04:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:04:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365788328] [2024-10-14 20:04:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365788328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:04:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740345175] [2024-10-14 20:04:02,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:04:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:04:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:04:02,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:04:02,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 20:04:02,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 20:04:02,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:04:02,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:04:02,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:04:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24144 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24135 trivial. 0 not checked. [2024-10-14 20:04:02,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:04:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740345175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:04:02,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:04:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [256] total 260 [2024-10-14 20:04:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130800389] [2024-10-14 20:04:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:04:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:04:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:04:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:04:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16647, Invalid=50693, Unknown=0, NotChecked=0, Total=67340 [2024-10-14 20:04:02,923 INFO L87 Difference]: Start difference. First operand 416 states and 418 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-14 20:04:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:04:02,945 INFO L93 Difference]: Finished difference Result 416 states and 418 transitions. [2024-10-14 20:04:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:04:02,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2024-10-14 20:04:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:04:02,947 INFO L225 Difference]: With dead ends: 416 [2024-10-14 20:04:02,947 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 20:04:02,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16761 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=16647, Invalid=50693, Unknown=0, NotChecked=0, Total=67340 [2024-10-14 20:04:02,952 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:04:02,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:04:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 20:04:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-10-14 20:04:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.0072463768115942) internal successors, (417), 414 states have internal predecessors, (417), 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-14 20:04:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 417 transitions. [2024-10-14 20:04:02,965 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 417 transitions. Word has length 413 [2024-10-14 20:04:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:04:02,966 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 417 transitions. [2024-10-14 20:04:02,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-14 20:04:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 417 transitions. [2024-10-14 20:04:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-10-14 20:04:02,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:04:02,971 INFO L215 NwaCegarLoop]: trace histogram [127, 127, 127, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:04:02,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 20:04:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 20:04:03,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2024-10-14 20:04:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:04:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 32978681, now seen corresponding path program 1 times [2024-10-14 20:04:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:04:03,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490866183] [2024-10-14 20:04:03,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:04:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:04:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:04:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 24145 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 24136 trivial. 0 not checked. [2024-10-14 20:04:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:04:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490866183] [2024-10-14 20:04:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490866183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:04:03,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:04:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:04:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661176666] [2024-10-14 20:04:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:04:03,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:04:03,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:04:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:04:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:04:03,457 INFO L87 Difference]: Start difference. First operand 415 states and 417 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-14 20:04:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:04:03,481 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2024-10-14 20:04:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:04:03,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2024-10-14 20:04:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:04:03,483 INFO L225 Difference]: With dead ends: 415 [2024-10-14 20:04:03,483 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:04:03,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:04:03,484 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:04:03,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:04:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:04:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:04:03,486 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-14 20:04:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:04:03,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2024-10-14 20:04:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:04:03,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:04:03,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-14 20:04:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:04:03,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:04:03,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2024-10-14 20:04:03,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2024-10-14 20:04:03,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2024-10-14 20:04:03,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2024-10-14 20:04:03,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2024-10-14 20:04:03,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2024-10-14 20:04:03,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2024-10-14 20:04:03,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2024-10-14 20:04:03,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 20:04:03,502 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:04:03,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:04:04,689 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:04:04,700 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2024-10-14 20:04:04,700 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2024-10-14 20:04:04,701 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~v~0 [2024-10-14 20:04:04,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:04:04 BoogieIcfgContainer [2024-10-14 20:04:04,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:04:04,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:04:04,710 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:04:04,710 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:04:04,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:03:01" (3/4) ... [2024-10-14 20:04:04,712 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:04:04,718 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:04:04,726 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-14 20:04:04,726 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 20:04:04,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:04:04,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:04:04,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:04:04,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:04:04,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:04:04,850 INFO L158 Benchmark]: Toolchain (without parser) took 63997.92ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 121.1MB in the beginning and 1.1GB in the end (delta: -945.9MB). Peak memory consumption was 838.8MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,850 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 102.8MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:04:04,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 108.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.17ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,850 INFO L158 Benchmark]: Boogie Preprocessor took 67.39ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 103.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,851 INFO L158 Benchmark]: RCFGBuilder took 546.49ms. Allocated memory is still 155.2MB. Free memory was 103.2MB in the beginning and 123.4MB in the end (delta: -20.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,851 INFO L158 Benchmark]: TraceAbstraction took 62918.41ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 122.3MB in the beginning and 1.1GB in the end (delta: -952.0MB). Peak memory consumption was 835.8MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,851 INFO L158 Benchmark]: Witness Printer took 139.41ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:04:04,853 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.12ms. Allocated memory is still 102.8MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 108.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.17ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.39ms. Allocated memory is still 155.2MB. Free memory was 106.4MB in the beginning and 103.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 546.49ms. Allocated memory is still 155.2MB. Free memory was 103.2MB in the beginning and 123.4MB in the end (delta: -20.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 62918.41ms. Allocated memory was 155.2MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 122.3MB in the beginning and 1.1GB in the end (delta: -952.0MB). Peak memory consumption was 835.8MB. Max. memory is 16.1GB. * Witness Printer took 139.41ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~v~0 * 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: 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, 94 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 18, TraceHistogramMax: 127, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 4040 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3059 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2273 IncrementalHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 981 mSDtfsCounter, 2273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1936 GetRequests, 1115 SyntacticMatches, 0 SemanticMatches, 821 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44542 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=16, InterpolantAutomatonStates: 550, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 252 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 54.4s InterpolantComputationTime, 2729 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3161 ConstructedInterpolants, 0 QuantifiedInterpolants, 6503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 53720/101136 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 28 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((n == 0) && (0 <= (v + 2147483648))) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((size == 0) && (i == 0)) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((n == 0) && (0 <= (v + 2147483648))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((1 <= x) && (n == 0)) || ((n == 0) && (x == 0))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((n == 0) && (0 <= (v + 2147483648))) && (x == 0)) && (v <= 99999)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-14 20:04:04,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE