./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/reducercommutativity/max40-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/max40-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:03:01,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:03:01,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:03:01,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:03:01,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:03:01,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:03:01,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:03:01,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:03:01,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:03:01,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:03:01,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:03:01,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:03:01,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:03:01,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:03:01,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:03:01,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:03:01,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:03:01,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:03:01,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:03:01,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:03:01,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:03:01,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:03:01,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:03:01,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:03:01,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:03:01,238 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:03:01,238 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:03:01,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:03:01,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:03:01,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:03:01,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:03:01,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:03:01,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:03:01,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:03:01,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:01,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:03:01,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:03:01,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:03:01,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:03:01,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:03:01,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:03:01,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:03:01,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:03:01,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:03:01,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 [2024-11-09 11:03:01,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:03:01,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:03:01,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:03:01,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:03:01,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:03:01,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max40-1.i [2024-11-09 11:03:02,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:03:03,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:03:03,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max40-1.i [2024-11-09 11:03:03,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f372088/a60b2a99cada488082dc28ba8b6834dc/FLAG29fafcb3b [2024-11-09 11:03:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62f372088/a60b2a99cada488082dc28ba8b6834dc [2024-11-09 11:03:03,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:03:03,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:03:03,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:03,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:03:03,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:03:03,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e41b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03, skipping insertion in model container [2024-11-09 11:03:03,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:03:03,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:03,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:03:03,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:03:03,844 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:03:03,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03 WrapperNode [2024-11-09 11:03:03,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:03:03,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:03,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:03:03,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:03:03,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,893 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-09 11:03:03,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:03:03,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:03:03,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:03:03,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:03:03,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,924 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-09 11:03:03,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:03:03,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:03:03,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:03:03,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:03:03,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (1/1) ... [2024-11-09 11:03:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:03:03,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:03,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:03:03,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:03:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:03:04,043 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-11-09 11:03:04,043 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-11-09 11:03:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:03:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:03:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 11:03:04,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:03:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:03:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:03:04,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:03:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:03:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:03:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:03:04,112 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:03:04,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:03:04,312 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 11:03:04,312 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:03:04,326 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:03:04,326 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 11:03:04,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:04 BoogieIcfgContainer [2024-11-09 11:03:04,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:03:04,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:03:04,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:03:04,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:03:04,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:03:03" (1/3) ... [2024-11-09 11:03:04,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383e956e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:04, skipping insertion in model container [2024-11-09 11:03:04,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:03" (2/3) ... [2024-11-09 11:03:04,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383e956e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:04, skipping insertion in model container [2024-11-09 11:03:04,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:04" (3/3) ... [2024-11-09 11:03:04,354 INFO L112 eAbstractionObserver]: Analyzing ICFG max40-1.i [2024-11-09 11:03:04,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:03:04,376 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 11:03:04,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:03:04,462 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;@15e63a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:03:04,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 11:03:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 11:03:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 11:03:04,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:04,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 11:03:04,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:04,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:04,479 INFO L85 PathProgramCache]: Analyzing trace with hash 54464963, now seen corresponding path program 1 times [2024-11-09 11:03:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:04,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170148080] [2024-11-09 11:03:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:04,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170148080] [2024-11-09 11:03:04,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170148080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520273674] [2024-11-09 11:03:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:04,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:04,804 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 40 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:04,866 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2024-11-09 11:03:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:04,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-09 11:03:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:04,875 INFO L225 Difference]: With dead ends: 87 [2024-11-09 11:03:04,876 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:03:04,878 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-11-09 11:03:04,881 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:04,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:03:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:03:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-09 11:03:04,911 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2024-11-09 11:03:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:04,911 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-09 11:03:04,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-09 11:03:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 11:03:04,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:04,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 11:03:04,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:03:04,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:04,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1177332607, now seen corresponding path program 1 times [2024-11-09 11:03:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805047236] [2024-11-09 11:03:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805047236] [2024-11-09 11:03:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805047236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242841122] [2024-11-09 11:03:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:05,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:05,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:05,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:05,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:03:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:05,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:03:05,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:05,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:05,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242841122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:03:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389492360] [2024-11-09 11:03:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:05,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:03:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:03:05,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:05,230 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-11-09 11:03:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:05,278 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-09 11:03:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:03:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-11-09 11:03:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:05,280 INFO L225 Difference]: With dead ends: 41 [2024-11-09 11:03:05,281 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 11:03:05,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:03:05,283 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:05,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 11:03:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 11:03:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 11:03:05,294 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 9 [2024-11-09 11:03:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:05,295 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 11:03:05,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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-11-09 11:03:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 11:03:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 11:03:05,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:05,297 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2024-11-09 11:03:05,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:03:05,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:05,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2137572522, now seen corresponding path program 1 times [2024-11-09 11:03:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:05,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842909229] [2024-11-09 11:03:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:05,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 11:03:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:05,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842909229] [2024-11-09 11:03:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842909229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347831236] [2024-11-09 11:03:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:05,572 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:05,593 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 11:03:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 11:03:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:05,595 INFO L225 Difference]: With dead ends: 40 [2024-11-09 11:03:05,596 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 11:03:05,597 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-11-09 11:03:05,599 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:05,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 11:03:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-09 11:03:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-09 11:03:05,611 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2024-11-09 11:03:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:05,615 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-09 11:03:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-09 11:03:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 11:03:05,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:05,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:05,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:03:05,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 127439927, now seen corresponding path program 1 times [2024-11-09 11:03:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775014099] [2024-11-09 11:03:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775014099] [2024-11-09 11:03:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775014099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707676412] [2024-11-09 11:03:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:05,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:05,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:05,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 11:03:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:05,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:05,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:05,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:03:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707676412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:05,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 11:03:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283718862] [2024-11-09 11:03:05,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:05,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:03:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:03:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:05,854 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:05,892 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2024-11-09 11:03:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:03:05,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 11:03:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:05,893 INFO L225 Difference]: With dead ends: 73 [2024-11-09 11:03:05,893 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 11:03:05,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:03:05,895 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:05,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 11:03:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 11:03:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-09 11:03:05,901 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2024-11-09 11:03:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:05,902 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-09 11:03:05,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-09 11:03:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 11:03:05,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:05,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:05,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:06,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 11:03:06,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:06,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1931603025, now seen corresponding path program 2 times [2024-11-09 11:03:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997378786] [2024-11-09 11:03:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997378786] [2024-11-09 11:03:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997378786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450590069] [2024-11-09 11:03:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:06,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:06,205 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:06,246 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2024-11-09 11:03:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:06,247 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 11:03:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:06,250 INFO L225 Difference]: With dead ends: 77 [2024-11-09 11:03:06,251 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 11:03:06,251 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-11-09 11:03:06,252 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 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-11-09 11:03:06,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 11:03:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 11:03:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.275) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 11:03:06,260 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2024-11-09 11:03:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:06,261 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 11:03:06,261 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 11:03:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 11:03:06,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:06,262 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:03:06,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:06,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2024256696, now seen corresponding path program 1 times [2024-11-09 11:03:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219778378] [2024-11-09 11:03:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:06,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:06,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219778378] [2024-11-09 11:03:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219778378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819182339] [2024-11-09 11:03:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:06,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:06,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:06,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:06,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 11:03:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:06,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 11:03:06,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:06,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819182339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 11:03:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322979849] [2024-11-09 11:03:06,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:03:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:03:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:03:06,788 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:06,866 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2024-11-09 11:03:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 11:03:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 11:03:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:06,867 INFO L225 Difference]: With dead ends: 101 [2024-11-09 11:03:06,867 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 11:03:06,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 11:03:06,869 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:06,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 11:03:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 11:03:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-09 11:03:06,884 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2024-11-09 11:03:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:06,885 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-09 11:03:06,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-09 11:03:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 11:03:06,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:06,886 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:06,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:07,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:07,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1580822072, now seen corresponding path program 2 times [2024-11-09 11:03:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205701981] [2024-11-09 11:03:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205701981] [2024-11-09 11:03:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205701981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684467983] [2024-11-09 11:03:07,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:03:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:07,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 11:03:07,499 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:03:07,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:07,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 11:03:07,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:07,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684467983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:07,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-09 11:03:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212204542] [2024-11-09 11:03:07,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 11:03:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 11:03:07,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:03:07,934 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:08,048 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2024-11-09 11:03:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 11:03:08,051 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-09 11:03:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:08,052 INFO L225 Difference]: With dead ends: 133 [2024-11-09 11:03:08,052 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 11:03:08,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 11:03:08,053 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:08,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:03:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 11:03:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 11:03:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.125) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2024-11-09 11:03:08,067 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2024-11-09 11:03:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:08,068 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2024-11-09 11:03:08,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2024-11-09 11:03:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 11:03:08,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:08,070 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:08,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 11:03:08,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:08,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:08,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash 904926232, now seen corresponding path program 3 times [2024-11-09 11:03:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:08,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680565300] [2024-11-09 11:03:08,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:03:09,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680565300] [2024-11-09 11:03:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680565300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018912275] [2024-11-09 11:03:09,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:03:09,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:09,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:09,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 11:03:09,171 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 11:03:09,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:03:09,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 11:03:09,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 11:03:09,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018912275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-09 11:03:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743207715] [2024-11-09 11:03:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:09,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:03:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:03:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:03:09,256 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:09,273 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-09 11:03:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 11:03:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:09,275 INFO L225 Difference]: With dead ends: 98 [2024-11-09 11:03:09,275 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 11:03:09,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 11:03:09,277 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:09,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 11:03:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 11:03:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 93 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2024-11-09 11:03:09,284 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 77 [2024-11-09 11:03:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:09,284 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2024-11-09 11:03:09,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2024-11-09 11:03:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 11:03:09,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:09,286 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:09,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 11:03:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:09,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:09,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2012057829, now seen corresponding path program 1 times [2024-11-09 11:03:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:09,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340392217] [2024-11-09 11:03:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-09 11:03:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340392217] [2024-11-09 11:03:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340392217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489250895] [2024-11-09 11:03:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:09,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:09,564 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:09,577 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-09 11:03:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 11:03:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:09,578 INFO L225 Difference]: With dead ends: 97 [2024-11-09 11:03:09,578 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 11:03:09,579 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-11-09 11:03:09,579 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:09,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 11:03:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2024-11-09 11:03:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 85 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-09 11:03:09,586 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 78 [2024-11-09 11:03:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:09,586 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-09 11:03:09,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-09 11:03:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 11:03:09,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:09,588 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 11:03:09,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 818560494, now seen corresponding path program 1 times [2024-11-09 11:03:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:09,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39180329] [2024-11-09 11:03:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:03:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 11:03:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-09 11:03:09,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39180329] [2024-11-09 11:03:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39180329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827319838] [2024-11-09 11:03:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:09,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:09,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:09,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 11:03:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:09,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:03:09,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-09 11:03:09,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:09,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827319838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:09,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 11:03:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451239966] [2024-11-09 11:03:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:09,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:09,910 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:09,930 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-09 11:03:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 11:03:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:09,932 INFO L225 Difference]: With dead ends: 94 [2024-11-09 11:03:09,932 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 11:03:09,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:09,934 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:09,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 11:03:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-09 11:03:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 87 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-09 11:03:09,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 92 [2024-11-09 11:03:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:09,950 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-09 11:03:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-09 11:03:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 11:03:09,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:09,951 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:09,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 11:03:10,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:10,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -394428369, now seen corresponding path program 1 times [2024-11-09 11:03:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704440009] [2024-11-09 11:03:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:03:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 11:03:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-09 11:03:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704440009] [2024-11-09 11:03:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704440009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:10,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207679837] [2024-11-09 11:03:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:10,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 11:03:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 11:03:10,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-09 11:03:10,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:03:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207679837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:10,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:03:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 11:03:10,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178896288] [2024-11-09 11:03:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:10,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:10,448 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:10,466 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-09 11:03:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-09 11:03:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:10,468 INFO L225 Difference]: With dead ends: 94 [2024-11-09 11:03:10,468 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 11:03:10,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:03:10,469 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:10,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:10,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 11:03:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-09 11:03:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 11:03:10,475 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 93 [2024-11-09 11:03:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 11:03:10,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 11:03:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 11:03:10,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:10,477 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:10,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 11:03:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:10,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1088537519, now seen corresponding path program 1 times [2024-11-09 11:03:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559109404] [2024-11-09 11:03:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 11:03:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 11:03:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-09 11:03:10,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559109404] [2024-11-09 11:03:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559109404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:10,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110182754] [2024-11-09 11:03:10,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:10,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:10,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:10,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 11:03:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:10,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 11:03:10,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:11,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 11:03:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110182754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:12,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:12,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2024-11-09 11:03:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812334123] [2024-11-09 11:03:12,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:12,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-09 11:03:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:12,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-09 11:03:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 11:03:12,693 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:03:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:12,933 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2024-11-09 11:03:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-09 11:03:12,933 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 95 [2024-11-09 11:03:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:12,934 INFO L225 Difference]: With dead ends: 194 [2024-11-09 11:03:12,935 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 11:03:12,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2024-11-09 11:03:12,937 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:12,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 268 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 11:03:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-09 11:03:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.0516129032258064) internal successors, (163), 158 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 167 transitions. [2024-11-09 11:03:12,965 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 167 transitions. Word has length 95 [2024-11-09 11:03:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 167 transitions. [2024-11-09 11:03:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.5074626865671643) internal successors, (168), 67 states have internal predecessors, (168), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:03:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 167 transitions. [2024-11-09 11:03:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 11:03:12,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:12,971 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:12,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 11:03:13,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 11:03:13,173 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:13,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 850272945, now seen corresponding path program 2 times [2024-11-09 11:03:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:13,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711774042] [2024-11-09 11:03:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:13,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 11:03:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 11:03:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2024-11-09 11:03:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:13,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711774042] [2024-11-09 11:03:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711774042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:13,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775017376] [2024-11-09 11:03:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:13,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:13,349 INFO L87 Difference]: Start difference. First operand 162 states and 167 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:13,374 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2024-11-09 11:03:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:13,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 11:03:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:13,375 INFO L225 Difference]: With dead ends: 167 [2024-11-09 11:03:13,375 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 11:03:13,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-09 11:03:13,377 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:13,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 11:03:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-09 11:03:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.0506329113924051) internal successors, (166), 161 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 170 transitions. [2024-11-09 11:03:13,390 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 170 transitions. Word has length 171 [2024-11-09 11:03:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 170 transitions. [2024-11-09 11:03:13,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 170 transitions. [2024-11-09 11:03:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-09 11:03:13,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:13,394 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:13,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 11:03:13,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1235709324, now seen corresponding path program 1 times [2024-11-09 11:03:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464291597] [2024-11-09 11:03:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 11:03:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 11:03:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2024-11-09 11:03:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464291597] [2024-11-09 11:03:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464291597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:03:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092531180] [2024-11-09 11:03:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:03:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:03:13,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:03:13,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 11:03:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:13,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 11:03:13,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:03:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 11:03:15,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:03:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1942 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-09 11:03:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092531180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 11:03:17,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 11:03:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 65, 65] total 84 [2024-11-09 11:03:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420078918] [2024-11-09 11:03:17,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 11:03:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-11-09 11:03:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-11-09 11:03:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=5286, Unknown=0, NotChecked=0, Total=6972 [2024-11-09 11:03:17,377 INFO L87 Difference]: Start difference. First operand 165 states and 170 transitions. Second operand has 84 states, 84 states have (on average 2.4761904761904763) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:03:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:17,690 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2024-11-09 11:03:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-09 11:03:17,696 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 2.4761904761904763) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 174 [2024-11-09 11:03:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:17,697 INFO L225 Difference]: With dead ends: 243 [2024-11-09 11:03:17,697 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 11:03:17,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 225 SyntacticMatches, 47 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1686, Invalid=5286, Unknown=0, NotChecked=0, Total=6972 [2024-11-09 11:03:17,699 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:17,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 326 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:03:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 11:03:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-11-09 11:03:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 196 states have (on average 1.0408163265306123) internal successors, (204), 199 states have internal predecessors, (204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 208 transitions. [2024-11-09 11:03:17,706 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 208 transitions. Word has length 174 [2024-11-09 11:03:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 208 transitions. [2024-11-09 11:03:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 2.4761904761904763) internal successors, (208), 84 states have internal predecessors, (208), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 11:03:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 208 transitions. [2024-11-09 11:03:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 11:03:17,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:17,708 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 40, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:17,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 11:03:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 11:03:17,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:17,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash 823814405, now seen corresponding path program 1 times [2024-11-09 11:03:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073474583] [2024-11-09 11:03:17,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:17,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:03:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 11:03:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3212 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3210 trivial. 0 not checked. [2024-11-09 11:03:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073474583] [2024-11-09 11:03:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073474583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:03:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625644528] [2024-11-09 11:03:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:03:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:03:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:18,047 INFO L87 Difference]: Start difference. First operand 203 states and 208 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:18,061 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2024-11-09 11:03:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:03:18,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 211 [2024-11-09 11:03:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:18,063 INFO L225 Difference]: With dead ends: 203 [2024-11-09 11:03:18,063 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 11:03:18,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:03:18,063 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:18,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 11:03:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-09 11:03:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 196 states have (on average 1.0357142857142858) internal successors, (203), 198 states have internal predecessors, (203), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 207 transitions. [2024-11-09 11:03:18,069 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 207 transitions. Word has length 211 [2024-11-09 11:03:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:18,070 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 207 transitions. [2024-11-09 11:03:18,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 207 transitions. [2024-11-09 11:03:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 11:03:18,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:18,072 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 40, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:18,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 11:03:18,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1411663783, now seen corresponding path program 1 times [2024-11-09 11:03:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822990469] [2024-11-09 11:03:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:03:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 11:03:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3214 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3211 trivial. 0 not checked. [2024-11-09 11:03:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822990469] [2024-11-09 11:03:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822990469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165862187] [2024-11-09 11:03:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:18,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:18,233 INFO L87 Difference]: Start difference. First operand 202 states and 207 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:18,251 INFO L93 Difference]: Finished difference Result 202 states and 207 transitions. [2024-11-09 11:03:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 213 [2024-11-09 11:03:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:18,253 INFO L225 Difference]: With dead ends: 202 [2024-11-09 11:03:18,253 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 11:03:18,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-09 11:03:18,254 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:18,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 11:03:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2024-11-09 11:03:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 194 states have (on average 1.0257731958762886) internal successors, (199), 194 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 11:03:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 203 transitions. [2024-11-09 11:03:18,261 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 203 transitions. Word has length 213 [2024-11-09 11:03:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:18,262 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 203 transitions. [2024-11-09 11:03:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 203 transitions. [2024-11-09 11:03:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 11:03:18,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:03:18,264 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 40, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:18,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 11:03:18,264 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 11:03:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:03:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash 811904412, now seen corresponding path program 1 times [2024-11-09 11:03:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:03:18,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079470207] [2024-11-09 11:03:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:03:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:03:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-09 11:03:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-09 11:03:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:03:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3215 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3210 trivial. 0 not checked. [2024-11-09 11:03:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:03:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079470207] [2024-11-09 11:03:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079470207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:03:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:03:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:03:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430849052] [2024-11-09 11:03:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:03:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:03:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:03:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:03:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:03:18,427 INFO L87 Difference]: Start difference. First operand 198 states and 203 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:03:18,443 INFO L93 Difference]: Finished difference Result 198 states and 203 transitions. [2024-11-09 11:03:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:03:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 214 [2024-11-09 11:03:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:03:18,444 INFO L225 Difference]: With dead ends: 198 [2024-11-09 11:03:18,444 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:03:18,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-09 11:03:18,446 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:03:18,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:03:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:03:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:03:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:03:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:03:18,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2024-11-09 11:03:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:03:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:03:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 11:03:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:03:18,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location maxErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-09 11:03:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-09 11:03:18,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 11:03:18,455 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:03:18,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:03:18,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:03:18,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:03:18 BoogieIcfgContainer [2024-11-09 11:03:18,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:03:18,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:03:18,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:03:18,533 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:03:18,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:03:04" (3/4) ... [2024-11-09 11:03:18,535 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:03:18,539 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure max [2024-11-09 11:03:18,543 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 11:03:18,543 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:03:18,544 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:03:18,544 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:03:18,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:03:18,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:03:18,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:03:18,641 INFO L158 Benchmark]: Toolchain (without parser) took 15098.47ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 95.9MB in the beginning and 181.3MB in the end (delta: -85.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,642 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 151.0MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:03:18,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.58ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 82.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.08ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 81.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:03:18,642 INFO L158 Benchmark]: Boogie Preprocessor took 52.76ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,642 INFO L158 Benchmark]: RCFGBuilder took 379.13ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 64.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,643 INFO L158 Benchmark]: TraceAbstraction took 14202.35ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 64.2MB in the beginning and 186.6MB in the end (delta: -122.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,643 INFO L158 Benchmark]: Witness Printer took 108.87ms. Allocated memory is still 283.1MB. Free memory was 186.6MB in the beginning and 181.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:03:18,647 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93ms. Allocated memory is still 151.0MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.58ms. Allocated memory is still 151.0MB. Free memory was 95.9MB in the beginning and 82.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.08ms. Allocated memory is still 151.0MB. Free memory was 82.7MB in the beginning and 81.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.76ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 78.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.13ms. Allocated memory is still 151.0MB. Free memory was 78.9MB in the beginning and 64.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14202.35ms. Allocated memory was 151.0MB in the beginning and 283.1MB in the end (delta: 132.1MB). Free memory was 64.2MB in the beginning and 186.6MB in the end (delta: -122.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 108.87ms. Allocated memory is still 283.1MB. Free memory was 186.6MB in the beginning and 181.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 17, TraceHistogramMax: 40, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2190 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1647 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 957 IncrementalHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 543 mSDtfsCounter, 957 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1116 GetRequests, 803 SyntacticMatches, 47 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6146 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=14, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 18 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 2183 NumberOfCodeBlocks, 2127 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2510 ConstructedInterpolants, 0 QuantifiedInterpolants, 3846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2048 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 16802/22254 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 8 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((i == 0) || (0 < i)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (0 < (2147483649 + i)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (0 < (2147483650 + i)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:03:18,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE