./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 628be9b0d43b46482b2f1f32ff1648acbb8b41e569549b972a02e76fffda9076 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:25:39,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:25:39,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 20:25:39,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:25:39,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:25:39,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:25:39,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:25:39,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:25:39,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:25:39,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:25:39,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:25:39,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:25:39,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:25:39,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:25:39,875 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:25:39,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:25:39,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:25:39,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:25:39,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:25:39,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:25:39,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:25:39,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:25:39,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:25:39,878 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:25:39,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:25:39,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:25:39,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:25:39,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:25:39,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:25:39,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:25:39,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:25:39,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:25:39,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:25:39,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:25:39,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:25:39,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:25:39,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:25:39,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:25:39,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:25:39,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:25:39,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:25:39,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 628be9b0d43b46482b2f1f32ff1648acbb8b41e569549b972a02e76fffda9076 [2024-10-11 20:25:40,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:25:40,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:25:40,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:25:40,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:25:40,191 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:25:40,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2024-10-11 20:25:41,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:25:41,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:25:41,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array16_alloca_original.i [2024-10-11 20:25:41,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86a5d3398/eb08191f718546c2b24c0df200579cbd/FLAGcee2b6f25 [2024-10-11 20:25:42,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86a5d3398/eb08191f718546c2b24c0df200579cbd [2024-10-11 20:25:42,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:25:42,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:25:42,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:42,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:25:42,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:25:42,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b41954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42, skipping insertion in model container [2024-10-11 20:25:42,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:25:42,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:42,619 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:25:42,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:25:42,713 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:25:42,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42 WrapperNode [2024-10-11 20:25:42,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:25:42,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:42,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:25:42,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:25:42,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,760 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2024-10-11 20:25:42,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:25:42,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:25:42,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:25:42,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:25:42,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,803 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-11 20:25:42,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:25:42,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:25:42,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:25:42,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:25:42,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (1/1) ... [2024-10-11 20:25:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:25:42,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:42,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:25:42,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:25:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:25:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:25:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:25:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:25:42,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:25:42,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:25:42,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:25:42,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:25:43,111 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 20:25:43,112 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:25:43,129 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:25:43,129 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:25:43,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:43 BoogieIcfgContainer [2024-10-11 20:25:43,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:25:43,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:25:43,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:25:43,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:25:43,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:42" (1/3) ... [2024-10-11 20:25:43,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cf5ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:43, skipping insertion in model container [2024-10-11 20:25:43,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:42" (2/3) ... [2024-10-11 20:25:43,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cf5ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:43, skipping insertion in model container [2024-10-11 20:25:43,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:43" (3/3) ... [2024-10-11 20:25:43,139 INFO L112 eAbstractionObserver]: Analyzing ICFG array16_alloca_original.i [2024-10-11 20:25:43,157 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:25:43,157 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 20:25:43,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:25:43,241 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;@4510eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:25:43,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 20:25:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 24 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-11 20:25:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:25:43,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:43,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:43,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:43,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:43,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1153354443, now seen corresponding path program 1 times [2024-10-11 20:25:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260963956] [2024-10-11 20:25:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260963956] [2024-10-11 20:25:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260963956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:43,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983243896] [2024-10-11 20:25:43,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:43,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:43,613 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 24 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) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:43,674 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2024-10-11 20:25:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:25:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:43,682 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:25:43,682 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:25:43,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:43,688 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:43,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:25:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:25:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 26 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-11 20:25:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-11 20:25:43,719 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 8 [2024-10-11 20:25:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-11 20:25:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-11 20:25:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:25:43,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:43,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:43,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:25:43,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1392776791, now seen corresponding path program 1 times [2024-10-11 20:25:43,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370320541] [2024-10-11 20:25:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:43,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370320541] [2024-10-11 20:25:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370320541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:25:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12371076] [2024-10-11 20:25:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:43,821 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:43,851 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-11 20:25:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:25:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:43,853 INFO L225 Difference]: With dead ends: 38 [2024-10-11 20:25:43,853 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 20:25:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:43,855 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:43,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 20:25:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 20:25:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 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-11 20:25:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-11 20:25:43,860 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2024-10-11 20:25:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:43,860 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-11 20:25:43,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-11 20:25:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:43,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:43,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:43,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:25:43,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:43,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:43,862 INFO L85 PathProgramCache]: Analyzing trace with hash 317160953, now seen corresponding path program 1 times [2024-10-11 20:25:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:43,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291009761] [2024-10-11 20:25:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:43,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291009761] [2024-10-11 20:25:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291009761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:44,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657957379] [2024-10-11 20:25:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:44,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:44,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:44,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:25:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:44,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:44,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:44,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657957379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:44,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:44,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2024-10-11 20:25:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568533475] [2024-10-11 20:25:44,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:44,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:44,226 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-11 20:25:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:44,290 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-11 20:25:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:25:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:44,292 INFO L225 Difference]: With dead ends: 64 [2024-10-11 20:25:44,292 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 20:25:44,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:25:44,293 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:44,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 74 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 20:25:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2024-10-11 20:25:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-11 20:25:44,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 13 [2024-10-11 20:25:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:44,306 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-11 20:25:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-11 20:25:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-11 20:25:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:25:44,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:44,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:44,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:25:44,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:44,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:44,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 575326391, now seen corresponding path program 1 times [2024-10-11 20:25:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129774126] [2024-10-11 20:25:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:44,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129774126] [2024-10-11 20:25:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129774126] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993238382] [2024-10-11 20:25:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:44,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:44,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:44,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:44,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:25:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:44,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:44,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:44,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993238382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:25:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11325109] [2024-10-11 20:25:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:44,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:44,749 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11 20:25:44,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:44,805 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-11 20:25:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:25:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:44,809 INFO L225 Difference]: With dead ends: 35 [2024-10-11 20:25:44,809 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 20:25:44,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:25:44,811 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:44,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 20:25:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 20:25:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-11 20:25:44,818 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 13 [2024-10-11 20:25:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:44,819 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-11 20:25:44,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-11 20:25:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-11 20:25:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:44,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:44,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:44,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:45,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:45,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1240582377, now seen corresponding path program 1 times [2024-10-11 20:25:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871201979] [2024-10-11 20:25:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871201979] [2024-10-11 20:25:45,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871201979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:45,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:45,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597154808] [2024-10-11 20:25:45,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:45,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:45,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,124 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11 20:25:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,184 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-11 20:25:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,186 INFO L225 Difference]: With dead ends: 40 [2024-10-11 20:25:45,187 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 20:25:45,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,188 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 20:25:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 20:25:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-11 20:25:45,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 14 [2024-10-11 20:25:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-11 20:25:45,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11 20:25:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-11 20:25:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:45,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:25:45,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1240582569, now seen corresponding path program 1 times [2024-10-11 20:25:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056173095] [2024-10-11 20:25:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056173095] [2024-10-11 20:25:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056173095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:45,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:45,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686158161] [2024-10-11 20:25:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:45,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:45,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:45,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,294 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11 20:25:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,321 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-11 20:25:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,323 INFO L225 Difference]: With dead ends: 42 [2024-10-11 20:25:45,323 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 20:25:45,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,325 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 20:25:45,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 20:25:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-10-11 20:25:45,332 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 14 [2024-10-11 20:25:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,332 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-10-11 20:25:45,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-11 20:25:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-10-11 20:25:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:25:45,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:25:45,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 655249000, now seen corresponding path program 1 times [2024-10-11 20:25:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738485952] [2024-10-11 20:25:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738485952] [2024-10-11 20:25:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738485952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516865412] [2024-10-11 20:25:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:45,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:45,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:45,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:25:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:45,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:45,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:45,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516865412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:45,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:45,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:25:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969235556] [2024-10-11 20:25:45,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:45,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:25:45,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:25:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:45,540 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,614 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-11 20:25:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:25:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,617 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:25:45,618 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:25:45,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:45,619 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:25:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 20:25:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-10-11 20:25:45,625 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 14 [2024-10-11 20:25:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,626 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-10-11 20:25:45,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-10-11 20:25:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:25:45,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:25:45,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:45,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -121106844, now seen corresponding path program 1 times [2024-10-11 20:25:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972344106] [2024-10-11 20:25:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:25:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972344106] [2024-10-11 20:25:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972344106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:45,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:45,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600424563] [2024-10-11 20:25:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:45,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,872 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,891 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-10-11 20:25:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11 20:25:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,893 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:25:45,893 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 20:25:45,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,894 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 20:25:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-10-11 20:25:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.34) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-10-11 20:25:45,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 18 [2024-10-11 20:25:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,900 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-10-11 20:25:45,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-10-11 20:25:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:25:45,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:25:45,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash -121106652, now seen corresponding path program 1 times [2024-10-11 20:25:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709621718] [2024-10-11 20:25:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:25:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709621718] [2024-10-11 20:25:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709621718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:25:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:25:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699217541] [2024-10-11 20:25:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:25:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:25:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,940 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:45,959 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-10-11 20:25:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:25:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11 20:25:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:45,960 INFO L225 Difference]: With dead ends: 54 [2024-10-11 20:25:45,960 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:25:45,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:25:45,961 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:45,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:25:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 20:25:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.32) internal successors, (66), 52 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-10-11 20:25:45,967 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 18 [2024-10-11 20:25:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-10-11 20:25:45,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-10-11 20:25:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:25:45,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:45,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:25:45,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:45,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 540655215, now seen corresponding path program 1 times [2024-10-11 20:25:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018782868] [2024-10-11 20:25:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018782868] [2024-10-11 20:25:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018782868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607219694] [2024-10-11 20:25:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:46,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:46,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:46,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:46,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:25:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:46,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:46,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607219694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-10-11 20:25:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129123513] [2024-10-11 20:25:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:25:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:25:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:25:46,167 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-11 20:25:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:46,209 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2024-10-11 20:25:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:25:46,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 19 [2024-10-11 20:25:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:46,210 INFO L225 Difference]: With dead ends: 77 [2024-10-11 20:25:46,210 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 20:25:46,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:25:46,211 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:46,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 20:25:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-11 20:25:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-10-11 20:25:46,217 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 19 [2024-10-11 20:25:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:46,217 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-10-11 20:25:46,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-11 20:25:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-10-11 20:25:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:25:46,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:46,219 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:46,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:25:46,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1748026037, now seen corresponding path program 1 times [2024-10-11 20:25:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471162836] [2024-10-11 20:25:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471162836] [2024-10-11 20:25:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471162836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802373792] [2024-10-11 20:25:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:46,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:46,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:25:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:25:46,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:46,591 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-11 20:25:46,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:25:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802373792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:25:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:25:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:25:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19640928] [2024-10-11 20:25:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:25:46,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:25:46,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:25:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:25:46,593 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11 20:25:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:46,626 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-10-11 20:25:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:25:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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 19 [2024-10-11 20:25:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:46,627 INFO L225 Difference]: With dead ends: 74 [2024-10-11 20:25:46,627 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 20:25:46,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:25:46,628 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:46,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 20:25:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 20:25:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.325) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-10-11 20:25:46,633 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 19 [2024-10-11 20:25:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:46,634 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-10-11 20:25:46,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 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-11 20:25:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-10-11 20:25:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:25:46,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:46,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:46,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:25:46,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:25:46,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:46,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1453489491, now seen corresponding path program 1 times [2024-10-11 20:25:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:46,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284476164] [2024-10-11 20:25:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:25:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284476164] [2024-10-11 20:25:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284476164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222907506] [2024-10-11 20:25:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:46,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:46,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:25:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:46,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:25:46,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:47,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222907506] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:47,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2024-10-11 20:25:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642343756] [2024-10-11 20:25:47,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:47,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:25:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:25:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:25:47,164 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:47,295 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-10-11 20:25:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:25:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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-11 20:25:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:47,296 INFO L225 Difference]: With dead ends: 61 [2024-10-11 20:25:47,296 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:25:47,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:25:47,297 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:47,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:25:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 20:25:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 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-11 20:25:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-10-11 20:25:47,303 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 19 [2024-10-11 20:25:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:47,303 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-10-11 20:25:47,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-10-11 20:25:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:25:47,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:47,304 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:47,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:25:47,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:25:47,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:47,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1778242487, now seen corresponding path program 1 times [2024-10-11 20:25:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453851832] [2024-10-11 20:25:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:25:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453851832] [2024-10-11 20:25:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453851832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804446729] [2024-10-11 20:25:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:47,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:47,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:47,579 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:47,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:25:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:47,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:25:47,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:25:47,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:25:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804446729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:47,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:25:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571090215] [2024-10-11 20:25:47,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:47,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:25:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:25:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:47,721 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 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-11 20:25:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:47,765 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-10-11 20:25:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:25:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 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 24 [2024-10-11 20:25:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:47,767 INFO L225 Difference]: With dead ends: 56 [2024-10-11 20:25:47,767 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 20:25:47,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:25:47,767 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:47,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:25:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 20:25:47,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 20:25:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-10-11 20:25:47,772 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 24 [2024-10-11 20:25:47,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:47,772 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-10-11 20:25:47,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 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-11 20:25:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-10-11 20:25:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 20:25:47,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:47,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:47,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:47,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:47,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash -314729880, now seen corresponding path program 2 times [2024-10-11 20:25:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041027828] [2024-10-11 20:25:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:48,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:48,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041027828] [2024-10-11 20:25:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041027828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:48,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500136224] [2024-10-11 20:25:48,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:48,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:48,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:48,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:48,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:25:48,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:25:48,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:48,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:25:48,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:25:48,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 20:25:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500136224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:48,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 16 [2024-10-11 20:25:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309825570] [2024-10-11 20:25:48,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:25:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:25:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:25:48,377 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:48,627 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-10-11 20:25:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 20:25:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 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 28 [2024-10-11 20:25:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:48,628 INFO L225 Difference]: With dead ends: 84 [2024-10-11 20:25:48,628 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 20:25:48,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-10-11 20:25:48,630 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:48,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 56 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 20:25:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 20:25:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 20:25:48,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2024-10-11 20:25:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:48,635 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 20:25:48,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 20:25:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:25:48,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:25:48,638 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-11 20:25:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 20:25:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:25:48,842 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 20:25:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:25:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -588438510, now seen corresponding path program 2 times [2024-10-11 20:25:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:25:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677331574] [2024-10-11 20:25:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:25:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:25:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:25:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:25:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:25:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677331574] [2024-10-11 20:25:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677331574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:25:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571799705] [2024-10-11 20:25:49,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:25:49,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:49,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:25:49,073 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:25:49,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:25:49,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:25:49,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:25:49,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:25:49,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:25:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 20:25:49,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:25:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 20:25:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571799705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:25:49,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:25:49,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 14 [2024-10-11 20:25:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183135984] [2024-10-11 20:25:49,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:25:49,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 20:25:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:25:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 20:25:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:25:49,282 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:25:49,459 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-10-11 20:25:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 20:25:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 20:25:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:25:49,460 INFO L225 Difference]: With dead ends: 36 [2024-10-11 20:25:49,460 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:25:49,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2024-10-11 20:25:49,461 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:25:49,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:25:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:25:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:25:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:25:49,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-10-11 20:25:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:25:49,463 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:25:49,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:25:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:25:49,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:25:49,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-11 20:25:49,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-11 20:25:49,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-11 20:25:49,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-11 20:25:49,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-11 20:25:49,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-11 20:25:49,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:25:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:25:49,670 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:25:49,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:25:49,823 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:25:49,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:25:49 BoogieIcfgContainer [2024-10-11 20:25:49,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:25:49,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:25:49,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:25:49,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:25:49,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:43" (3/4) ... [2024-10-11 20:25:49,844 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:25:49,850 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 20:25:49,851 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:25:49,851 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:25:49,851 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:25:49,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:25:49,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:25:49,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:25:49,938 INFO L158 Benchmark]: Toolchain (without parser) took 7713.74ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 95.5MB in the beginning and 109.0MB in the end (delta: -13.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,939 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:25:49,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.64ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 75.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,939 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.66ms. Allocated memory is still 151.0MB. Free memory was 75.6MB in the beginning and 73.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,939 INFO L158 Benchmark]: Boogie Preprocessor took 53.57ms. Allocated memory is still 151.0MB. Free memory was 73.8MB in the beginning and 121.4MB in the end (delta: -47.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,939 INFO L158 Benchmark]: RCFGBuilder took 314.31ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 121.3MB in the beginning and 146.9MB in the end (delta: -25.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,940 INFO L158 Benchmark]: TraceAbstraction took 6708.61ms. Allocated memory is still 186.6MB. Free memory was 146.9MB in the beginning and 113.1MB in the end (delta: 33.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,940 INFO L158 Benchmark]: Witness Printer took 96.54ms. Allocated memory is still 186.6MB. Free memory was 113.1MB in the beginning and 109.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:25:49,941 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.23ms. Allocated memory is still 151.0MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.64ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 75.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.66ms. Allocated memory is still 151.0MB. Free memory was 75.6MB in the beginning and 73.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.57ms. Allocated memory is still 151.0MB. Free memory was 73.8MB in the beginning and 121.4MB in the end (delta: -47.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 314.31ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 121.3MB in the beginning and 146.9MB in the end (delta: -25.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6708.61ms. Allocated memory is still 186.6MB. Free memory was 146.9MB in the beginning and 113.1MB in the end (delta: 33.8MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 96.54ms. Allocated memory is still 186.6MB. Free memory was 113.1MB in the beginning and 109.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 370]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 370]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 379]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 379]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 903 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 678 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 225 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 250 SyntacticMatches, 8 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=10, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 437 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 1306 SizeOfPredicates, 11 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 29 InterpolantComputations, 10 PerfectInterpolantSequences, 162/305 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ((((length <= 2147483647) && (1 <= i)) && (1 <= length)) || (((length <= 2147483647) && (i == 0)) && (1 <= length))) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ((((((long) j + 1) <= 0) && (1 <= length)) || (length == 1)) || (((length <= 2147483647) && (j <= 2147483647)) && (1 <= length))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:25:49,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE