./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:09:32,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:09:32,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:09:32,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:09:32,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:09:32,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:09:32,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:09:32,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:09:32,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:09:32,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:09:32,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:09:32,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:09:32,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:09:32,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:09:32,233 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:09:32,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:09:32,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:09:32,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:09:32,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:09:32,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:09:32,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:09:32,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:09:32,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:09:32,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:09:32,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:09:32,242 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:09:32,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:09:32,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:09:32,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:09:32,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:09:32,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:09:32,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:09:32,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:09:32,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:09:32,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:32,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:09:32,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:09:32,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:09:32,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:09:32,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:09:32,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:09:32,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:09:32,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:09:32,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:09:32,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2024-10-11 20:09:32,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:09:32,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:09:32,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:09:32,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:09:32,550 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:09:32,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-11 20:09:33,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:09:34,268 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:09:34,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-11 20:09:34,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/70f79d9b7/d71b6fe3dccc469697460bc48c0deaad/FLAGcc645c6ef [2024-10-11 20:09:34,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/70f79d9b7/d71b6fe3dccc469697460bc48c0deaad [2024-10-11 20:09:34,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:09:34,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:09:34,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:34,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:09:34,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:09:34,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72fee313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34, skipping insertion in model container [2024-10-11 20:09:34,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:09:34,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:34,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:09:34,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:09:34,837 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:09:34,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34 WrapperNode [2024-10-11 20:09:34,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:09:34,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:34,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:09:34,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:09:34,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,894 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-11 20:09:34,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:09:34,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:09:34,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:09:34,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:09:34,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,929 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-11 20:09:34,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:09:34,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:09:34,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:09:34,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:09:34,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (1/1) ... [2024-10-11 20:09:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:09:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:34,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:09:34,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:09:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:09:35,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:09:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:09:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:09:35,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:09:35,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:09:35,151 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:09:35,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:09:35,315 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 20:09:35,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:09:35,340 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:09:35,340 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:09:35,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:35 BoogieIcfgContainer [2024-10-11 20:09:35,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:09:35,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:09:35,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:09:35,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:09:35,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:34" (1/3) ... [2024-10-11 20:09:35,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b27e1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:35, skipping insertion in model container [2024-10-11 20:09:35,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:34" (2/3) ... [2024-10-11 20:09:35,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b27e1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:35, skipping insertion in model container [2024-10-11 20:09:35,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:35" (3/3) ... [2024-10-11 20:09:35,365 INFO L112 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2024-10-11 20:09:35,385 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:09:35,385 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 20:09:35,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:09:35,467 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;@1a61c465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:09:35,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-11 20:09:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 20:09:35,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:35,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 20:09:35,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 109135861, now seen corresponding path program 1 times [2024-10-11 20:09:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550484154] [2024-10-11 20:09:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550484154] [2024-10-11 20:09:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550484154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912047603] [2024-10-11 20:09:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:35,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:35,773 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.88) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-10-11 20:09:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:35,822 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-10-11 20:09:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:35,825 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-10-11 20:09:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:35,832 INFO L225 Difference]: With dead ends: 77 [2024-10-11 20:09:35,832 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:09:35,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:35,837 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:35,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:09:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 20:09:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-10-11 20:09:35,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 5 [2024-10-11 20:09:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-10-11 20:09:35,863 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-10-11 20:09:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-10-11 20:09:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:09:35,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:35,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:35,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:09:35,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:35,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1798150634, now seen corresponding path program 1 times [2024-10-11 20:09:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300431115] [2024-10-11 20:09:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300431115] [2024-10-11 20:09:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300431115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:35,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:09:35,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003581605] [2024-10-11 20:09:35,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:35,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:35,981 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:36,005 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2024-10-11 20:09:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:09:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:36,007 INFO L225 Difference]: With dead ends: 71 [2024-10-11 20:09:36,007 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 20:09:36,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:36,009 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 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-10-11 20:09:36,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 20:09:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 20:09:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-10-11 20:09:36,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2024-10-11 20:09:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:36,020 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-10-11 20:09:36,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-10-11 20:09:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:09:36,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:36,021 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:09:36,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -23753348, now seen corresponding path program 1 times [2024-10-11 20:09:36,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:36,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256662141] [2024-10-11 20:09:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:36,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256662141] [2024-10-11 20:09:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256662141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368915663] [2024-10-11 20:09:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:36,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:36,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:36,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:36,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:09:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:36,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:36,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:36,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368915663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:36,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:36,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2024-10-11 20:09:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629906335] [2024-10-11 20:09:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:36,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:36,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:09:36,338 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:36,390 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-11 20:09:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:09:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:36,392 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:09:36,392 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 20:09:36,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:09:36,396 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:36,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 20:09:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-11 20:09:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-10-11 20:09:36,406 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2024-10-11 20:09:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:36,407 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-10-11 20:09:36,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-10-11 20:09:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:09:36,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:36,408 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:36,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:09:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:36,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1751254014, now seen corresponding path program 1 times [2024-10-11 20:09:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146443250] [2024-10-11 20:09:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146443250] [2024-10-11 20:09:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146443250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232741012] [2024-10-11 20:09:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:36,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:36,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:09:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:36,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:36,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:36,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232741012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:09:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123559689] [2024-10-11 20:09:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:36,855 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:36,896 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-10-11 20:09:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 20:09:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:36,901 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:09:36,901 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 20:09:36,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:09:36,903 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:36,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 20:09:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 20:09:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-10-11 20:09:36,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 8 [2024-10-11 20:09:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:36,914 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-10-11 20:09:36,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-10-11 20:09:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 20:09:36,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:36,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-11 20:09:36,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:09:37,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:37,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1545700361, now seen corresponding path program 1 times [2024-10-11 20:09:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847433032] [2024-10-11 20:09:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847433032] [2024-10-11 20:09:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847433032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21429384] [2024-10-11 20:09:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:37,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:37,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:09:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:37,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:37,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:37,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:37,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21429384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:37,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:37,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-11 20:09:37,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78950392] [2024-10-11 20:09:37,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:37,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 20:09:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:37,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 20:09:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:37,416 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:37,476 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-11 20:09:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:37,476 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 20:09:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:37,478 INFO L225 Difference]: With dead ends: 55 [2024-10-11 20:09:37,479 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 20:09:37,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:37,481 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:37,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 20:09:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 20:09:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-11 20:09:37,493 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 9 [2024-10-11 20:09:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:37,493 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-11 20:09:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-11 20:09:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:09:37,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:37,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:37,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:37,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:37,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1354327631, now seen corresponding path program 1 times [2024-10-11 20:09:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821298301] [2024-10-11 20:09:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:37,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:37,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821298301] [2024-10-11 20:09:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821298301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820120726] [2024-10-11 20:09:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:37,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:37,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:37,745 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:37,769 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-10-11 20:09:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-10-11 20:09:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:37,773 INFO L225 Difference]: With dead ends: 54 [2024-10-11 20:09:37,774 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 20:09:37,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:37,775 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:37,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 20:09:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 20:09:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-10-11 20:09:37,786 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 10 [2024-10-11 20:09:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:37,787 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-11 20:09:37,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-10-11 20:09:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:09:37,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:37,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:37,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:09:37,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash 965516471, now seen corresponding path program 1 times [2024-10-11 20:09:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887969750] [2024-10-11 20:09:37,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:37,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887969750] [2024-10-11 20:09:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887969750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657639046] [2024-10-11 20:09:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:37,864 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:37,895 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-10-11 20:09:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:37,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:09:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:37,896 INFO L225 Difference]: With dead ends: 83 [2024-10-11 20:09:37,897 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 20:09:37,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:37,899 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 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-10-11 20:09:37,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 20:09:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 20:09:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.5) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-10-11 20:09:37,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 11 [2024-10-11 20:09:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-10-11 20:09:37,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-10-11 20:09:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:09:37,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:37,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:37,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:09:37,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:37,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 572489461, now seen corresponding path program 1 times [2024-10-11 20:09:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137298658] [2024-10-11 20:09:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137298658] [2024-10-11 20:09:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137298658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240112109] [2024-10-11 20:09:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:38,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:38,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:38,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:09:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:09:38,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:38,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240112109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-10-11 20:09:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184302582] [2024-10-11 20:09:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:38,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:38,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:38,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:09:38,113 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:38,146 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-11 20:09:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 20:09:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:38,149 INFO L225 Difference]: With dead ends: 72 [2024-10-11 20:09:38,149 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 20:09:38,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:09:38,150 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:38,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 20:09:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-10-11 20:09:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.56) internal successors, (78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-10-11 20:09:38,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 11 [2024-10-11 20:09:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:38,158 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-10-11 20:09:38,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-10-11 20:09:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 20:09:38,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:38,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:38,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:09:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:09:38,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 406560599, now seen corresponding path program 1 times [2024-10-11 20:09:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659673829] [2024-10-11 20:09:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659673829] [2024-10-11 20:09:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659673829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:09:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658295754] [2024-10-11 20:09:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:38,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:38,397 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:38,437 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2024-10-11 20:09:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 20:09:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:38,438 INFO L225 Difference]: With dead ends: 91 [2024-10-11 20:09:38,438 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 20:09:38,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:38,439 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:38,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 20:09:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-11 20:09:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 81 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2024-10-11 20:09:38,446 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 13 [2024-10-11 20:09:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:38,446 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2024-10-11 20:09:38,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2024-10-11 20:09:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:09:38,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:38,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:38,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:09:38,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash -281524360, now seen corresponding path program 1 times [2024-10-11 20:09:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:38,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641370496] [2024-10-11 20:09:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641370496] [2024-10-11 20:09:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641370496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:38,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711157022] [2024-10-11 20:09:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:38,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:38,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,488 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:38,519 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-10-11 20:09:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:38,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 20:09:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:38,521 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:09:38,521 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 20:09:38,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,522 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:38,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 20:09:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 20:09:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.457142857142857) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-10-11 20:09:38,534 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 14 [2024-10-11 20:09:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:38,535 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-10-11 20:09:38,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-10-11 20:09:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 20:09:38,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:38,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:38,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:09:38,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:38,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash -137320460, now seen corresponding path program 1 times [2024-10-11 20:09:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640175796] [2024-10-11 20:09:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640175796] [2024-10-11 20:09:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640175796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370990260] [2024-10-11 20:09:38,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:38,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:38,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,591 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:38,622 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-10-11 20:09:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 20:09:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:38,623 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:09:38,623 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:09:38,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,624 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:38,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:09:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2024-10-11 20:09:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 83 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-10-11 20:09:38,632 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 15 [2024-10-11 20:09:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:38,632 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-10-11 20:09:38,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-10-11 20:09:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 20:09:38,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:38,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:38,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:09:38,633 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:38,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1212439238, now seen corresponding path program 1 times [2024-10-11 20:09:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560116179] [2024-10-11 20:09:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560116179] [2024-10-11 20:09:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560116179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:38,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597649489] [2024-10-11 20:09:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:38,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,692 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:38,740 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2024-10-11 20:09:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:38,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 20:09:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:38,741 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:09:38,741 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 20:09:38,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:38,742 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:38,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 20:09:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-11 20:09:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 89 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2024-10-11 20:09:38,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 17 [2024-10-11 20:09:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:38,752 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2024-10-11 20:09:38,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2024-10-11 20:09:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:09:38,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:38,752 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2024-10-11 20:09:38,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:09:38,753 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:38,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:38,753 INFO L85 PathProgramCache]: Analyzing trace with hash 828839330, now seen corresponding path program 2 times [2024-10-11 20:09:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:38,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540792439] [2024-10-11 20:09:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:09:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540792439] [2024-10-11 20:09:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540792439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757359045] [2024-10-11 20:09:38,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:38,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:38,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:09:38,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:38,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:38,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:38,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:09:39,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 20:09:39,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757359045] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:39,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 2, 2] total 13 [2024-10-11 20:09:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623533547] [2024-10-11 20:09:39,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:39,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:09:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:09:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:09:39,058 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:39,217 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-10-11 20:09:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:09:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 20:09:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:39,218 INFO L225 Difference]: With dead ends: 93 [2024-10-11 20:09:39,218 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 20:09:39,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:09:39,219 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:39,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 20:09:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-10-11 20:09:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.411764705882353) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-10-11 20:09:39,225 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 18 [2024-10-11 20:09:39,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:39,226 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-10-11 20:09:39,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-10-11 20:09:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:09:39,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:39,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:39,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:09:39,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 20:09:39,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2104893361, now seen corresponding path program 1 times [2024-10-11 20:09:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793868610] [2024-10-11 20:09:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:39,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793868610] [2024-10-11 20:09:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793868610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:39,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:39,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477301161] [2024-10-11 20:09:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:09:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:09:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:39,466 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:39,510 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2024-10-11 20:09:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:09:39,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 20:09:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:39,511 INFO L225 Difference]: With dead ends: 121 [2024-10-11 20:09:39,512 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 20:09:39,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:09:39,512 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:39,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 20:09:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 20:09:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 77 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2024-10-11 20:09:39,517 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 18 [2024-10-11 20:09:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:39,517 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2024-10-11 20:09:39,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2024-10-11 20:09:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 20:09:39,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:39,518 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:39,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:09:39,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 770017602, now seen corresponding path program 1 times [2024-10-11 20:09:39,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251886212] [2024-10-11 20:09:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:09:39,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:39,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251886212] [2024-10-11 20:09:39,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251886212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:39,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023265356] [2024-10-11 20:09:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:39,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:39,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:39,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:09:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:39,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:09:39,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:09:39,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:09:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023265356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:39,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 11 [2024-10-11 20:09:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992767036] [2024-10-11 20:09:39,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:39,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:09:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:09:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:09:39,747 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:39,923 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2024-10-11 20:09:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:09:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 20:09:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:39,924 INFO L225 Difference]: With dead ends: 176 [2024-10-11 20:09:39,924 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 20:09:39,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:09:39,926 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:39,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:09:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 20:09:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2024-10-11 20:09:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 98 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2024-10-11 20:09:39,938 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 22 [2024-10-11 20:09:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:39,938 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2024-10-11 20:09:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2024-10-11 20:09:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 20:09:39,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:39,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:39,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:40,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:09:40,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2040048166, now seen corresponding path program 1 times [2024-10-11 20:09:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:40,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213293492] [2024-10-11 20:09:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:40,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213293492] [2024-10-11 20:09:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213293492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764859975] [2024-10-11 20:09:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:40,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:40,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:09:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:40,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:09:40,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:40,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 20:09:40,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764859975] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:40,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:40,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-11 20:09:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477185881] [2024-10-11 20:09:40,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:40,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 20:09:40,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 20:09:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:09:40,338 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:40,441 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-11 20:09:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:09:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 26 [2024-10-11 20:09:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:40,443 INFO L225 Difference]: With dead ends: 122 [2024-10-11 20:09:40,444 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 20:09:40,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:09:40,444 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:40,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 20:09:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-11 20:09:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2024-10-11 20:09:40,451 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 26 [2024-10-11 20:09:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:40,451 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2024-10-11 20:09:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2024-10-11 20:09:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 20:09:40,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:40,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:40,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:09:40,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:40,653 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:40,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1287581498, now seen corresponding path program 1 times [2024-10-11 20:09:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595253406] [2024-10-11 20:09:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 20:09:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:40,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595253406] [2024-10-11 20:09:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595253406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478014056] [2024-10-11 20:09:40,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:40,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:40,722 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:40,761 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2024-10-11 20:09:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:40,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 20:09:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:40,764 INFO L225 Difference]: With dead ends: 115 [2024-10-11 20:09:40,764 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:09:40,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:40,765 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:40,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:09:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 20:09:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.205607476635514) internal successors, (129), 110 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-10-11 20:09:40,771 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 29 [2024-10-11 20:09:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:40,772 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-10-11 20:09:40,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-10-11 20:09:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:09:40,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:40,774 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:40,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:09:40,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:40,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1998842447, now seen corresponding path program 1 times [2024-10-11 20:09:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017678049] [2024-10-11 20:09:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 20:09:40,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017678049] [2024-10-11 20:09:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017678049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952107716] [2024-10-11 20:09:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:40,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:40,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:09:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:41,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:09:41,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:09:41,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:41,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952107716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:41,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2024-10-11 20:09:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77503275] [2024-10-11 20:09:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:41,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:09:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:09:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:09:41,152 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:41,199 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-10-11 20:09:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:09:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 30 [2024-10-11 20:09:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:41,200 INFO L225 Difference]: With dead ends: 113 [2024-10-11 20:09:41,200 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 20:09:41,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:09:41,201 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:41,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 20:09:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-10-11 20:09:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2024-10-11 20:09:41,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 30 [2024-10-11 20:09:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:41,228 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2024-10-11 20:09:41,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2024-10-11 20:09:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 20:09:41,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:41,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:41,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:09:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 20:09:41,433 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:41,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1836762451, now seen corresponding path program 1 times [2024-10-11 20:09:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:41,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680059224] [2024-10-11 20:09:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 20:09:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680059224] [2024-10-11 20:09:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680059224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:09:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:09:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599602779] [2024-10-11 20:09:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:41,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:41,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:41,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:41,477 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:41,505 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2024-10-11 20:09:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:09:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 20:09:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:41,506 INFO L225 Difference]: With dead ends: 110 [2024-10-11 20:09:41,506 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 20:09:41,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:09:41,507 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 20:09:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 20:09:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 108 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2024-10-11 20:09:41,512 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 39 [2024-10-11 20:09:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:41,512 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2024-10-11 20:09:41,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2024-10-11 20:09:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 20:09:41,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:41,513 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:09:41,513 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1466046981, now seen corresponding path program 1 times [2024-10-11 20:09:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483088951] [2024-10-11 20:09:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:09:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483088951] [2024-10-11 20:09:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483088951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365600440] [2024-10-11 20:09:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:41,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:41,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:41,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:41,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:09:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:41,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 20:09:41,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:09:41,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 20:09:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365600440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:41,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2024-10-11 20:09:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127469022] [2024-10-11 20:09:41,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 20:09:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:41,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 20:09:41,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:41,950 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:42,031 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2024-10-11 20:09:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:09:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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 43 [2024-10-11 20:09:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:42,032 INFO L225 Difference]: With dead ends: 213 [2024-10-11 20:09:42,032 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 20:09:42,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:09:42,033 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:42,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 20:09:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-10-11 20:09:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.1346153846153846) internal successors, (177), 157 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2024-10-11 20:09:42,039 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 43 [2024-10-11 20:09:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:42,039 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2024-10-11 20:09:42,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2024-10-11 20:09:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 20:09:42,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:42,041 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:42,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:42,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:42,242 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1424561798, now seen corresponding path program 2 times [2024-10-11 20:09:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21302719] [2024-10-11 20:09:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 20:09:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21302719] [2024-10-11 20:09:42,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21302719] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565534365] [2024-10-11 20:09:42,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:42,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:42,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:42,403 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:09:42,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:42,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:42,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:09:42,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 20:09:42,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:09:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565534365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:09:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:09:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-10-11 20:09:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65490484] [2024-10-11 20:09:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:09:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:09:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:09:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:09:42,500 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:42,544 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2024-10-11 20:09:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:09:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 20:09:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:42,545 INFO L225 Difference]: With dead ends: 158 [2024-10-11 20:09:42,545 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 20:09:42,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:09:42,546 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:42,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:09:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 20:09:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2024-10-11 20:09:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2024-10-11 20:09:42,552 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 44 [2024-10-11 20:09:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:42,552 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-10-11 20:09:42,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2024-10-11 20:09:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 20:09:42,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:09:42,553 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:42,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:09:42,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 20:09:42,754 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 20:09:42,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:09:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash 152313104, now seen corresponding path program 2 times [2024-10-11 20:09:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:09:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123900286] [2024-10-11 20:09:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:09:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:09:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:09:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 20:09:42,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:09:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123900286] [2024-10-11 20:09:42,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123900286] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:09:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547000507] [2024-10-11 20:09:42,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:09:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:09:42,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:09:42,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:09:42,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:09:43,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 20:09:43,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:09:43,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:09:43,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:09:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:09:43,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:09:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:09:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547000507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:09:43,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:09:43,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-10-11 20:09:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256812542] [2024-10-11 20:09:43,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:09:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:09:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:09:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:09:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:09:43,198 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:09:43,435 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2024-10-11 20:09:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 20:09:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 17 states have internal predecessors, (78), 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 46 [2024-10-11 20:09:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:09:43,436 INFO L225 Difference]: With dead ends: 100 [2024-10-11 20:09:43,436 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:09:43,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:09:43,437 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:09:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 121 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:09:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:09:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:09:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:09:43,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-10-11 20:09:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:09:43,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:09:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:09:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:09:43,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:09:43,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-10-11 20:09:43,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-10-11 20:09:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-10-11 20:09:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-10-11 20:09:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-10-11 20:09:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-10-11 20:09:43,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 20:09:43,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:09:43,646 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:09:43,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:09:43,922 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:09:43,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:09:43 BoogieIcfgContainer [2024-10-11 20:09:43,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:09:43,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:09:43,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:09:43,945 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:09:43,946 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:35" (3/4) ... [2024-10-11 20:09:43,948 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:09:43,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 20:09:43,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:09:43,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 20:09:43,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:09:44,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:09:44,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:09:44,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:09:44,062 INFO L158 Benchmark]: Toolchain (without parser) took 9744.71ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 98.9MB in the beginning and 169.5MB in the end (delta: -70.6MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,062 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 115.0MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:09:44,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.35ms. Allocated memory is still 153.1MB. Free memory was 98.9MB in the beginning and 80.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.77ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,063 INFO L158 Benchmark]: Boogie Preprocessor took 45.96ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,064 INFO L158 Benchmark]: RCFGBuilder took 395.60ms. Allocated memory is still 153.1MB. Free memory was 76.2MB in the beginning and 62.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,064 INFO L158 Benchmark]: TraceAbstraction took 8585.90ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 122.8MB in the beginning and 174.8MB in the end (delta: -52.0MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,064 INFO L158 Benchmark]: Witness Printer took 116.49ms. Allocated memory is still 234.9MB. Free memory was 174.8MB in the beginning and 169.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:09:44,066 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.98ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 115.0MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.35ms. Allocated memory is still 153.1MB. Free memory was 98.9MB in the beginning and 80.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.77ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.96ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.60ms. Allocated memory is still 153.1MB. Free memory was 76.2MB in the beginning and 62.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8585.90ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 122.8MB in the beginning and 174.8MB in the end (delta: -52.0MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. * Witness Printer took 116.49ms. Allocated memory is still 234.9MB. Free memory was 174.8MB in the beginning and 169.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 528]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 528]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 516]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 515]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 2024 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1455 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1327 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 569 mSDtfsCounter, 1327 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 380 SyntacticMatches, 16 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=20, InterpolantAutomatonStates: 139, 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, 22 MinimizatonAttempts, 104 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 708 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 833 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 12 NumberOfNonLiveVariables, 751 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 39 InterpolantComputations, 16 PerfectInterpolantSequences, 356/548 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 14 specifications checked. All of them hold - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((array_size <= 2147483647) && (1 <= i)) && (1 <= array_size)) || (((array_size <= 2147483647) && (i == 0)) && (1 <= array_size))) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((n < ((long long) pass + 1)) || ((n <= 2147483647) && (pass == 1))) || ((2 <= pass) && (n <= 2147483647))) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: (((((0 <= (i + 2147483649)) && (2 <= n)) && (n <= 2147483647)) && (pass == 1)) || ((((0 <= (i + 2147483649)) && (2 <= pass)) && (((long long) pass + 1) <= n)) && (n <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:09:44,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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