./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:34:45,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:34:45,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:34:45,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:34:45,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:34:45,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:34:45,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:34:45,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:34:45,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:34:45,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:34:45,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:34:45,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:34:45,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:34:45,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:34:45,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:34:45,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:34:45,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:34:45,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:34:45,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:34:45,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:34:45,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:34:45,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:34:45,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:34:45,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:34:45,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:34:45,582 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:34:45,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:34:45,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:34:45,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:34:45,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:34:45,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:34:45,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:34:45,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:34:45,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:34:45,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:34:45,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:34:45,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:34:45,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:34:45,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:34:45,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb7e704db84b45f8c7f1cb386fc610e1107f57c6e67c0a3b2af510d7426cfd4f [2024-11-19 10:34:45,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:34:45,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:34:45,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:34:45,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:34:45,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:34:45,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2024-11-19 10:34:46,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:34:47,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:34:47,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2024-11-19 10:34:47,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f594f0080/9331d7cdedc54b2681a72dcde8532744/FLAG37cb3c3e3 [2024-11-19 10:34:47,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f594f0080/9331d7cdedc54b2681a72dcde8532744 [2024-11-19 10:34:47,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:34:47,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:34:47,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:34:47,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:34:47,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:34:47,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff3580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47, skipping insertion in model container [2024-11-19 10:34:47,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:34:47,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:34:47,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:34:47,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:34:47,755 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:34:47,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47 WrapperNode [2024-11-19 10:34:47,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:34:47,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:34:47,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:34:47,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:34:47,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,788 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-11-19 10:34:47,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:34:47,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:34:47,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:34:47,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:34:47,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,819 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 10:34:47,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:34:47,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:34:47,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:34:47,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:34:47,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (1/1) ... [2024-11-19 10:34:47,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:34:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:34:47,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:34:47,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:34:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:34:47,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:34:47,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:34:47,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:34:47,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:34:47,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:34:47,941 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:34:47,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:34:48,101 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-19 10:34:48,102 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:34:48,110 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:34:48,113 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 10:34:48,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:48 BoogieIcfgContainer [2024-11-19 10:34:48,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:34:48,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:34:48,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:34:48,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:34:48,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:34:47" (1/3) ... [2024-11-19 10:34:48,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e2928c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:48, skipping insertion in model container [2024-11-19 10:34:48,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:47" (2/3) ... [2024-11-19 10:34:48,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e2928c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:48, skipping insertion in model container [2024-11-19 10:34:48,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:48" (3/3) ... [2024-11-19 10:34:48,134 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2024-11-19 10:34:48,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:34:48,152 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 10:34:48,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:34:48,203 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;@537e5a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:34:48,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 10:34:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 10:34:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:34:48,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:48,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:34:48,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-19 10:34:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:48,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934264956] [2024-11-19 10:34:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:48,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934264956] [2024-11-19 10:34:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934264956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:34:48,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738024356] [2024-11-19 10:34:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 10:34:48,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:48,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 10:34:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:34:48,360 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:48,379 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2024-11-19 10:34:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 10:34:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 10:34:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:48,386 INFO L225 Difference]: With dead ends: 72 [2024-11-19 10:34:48,386 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 10:34:48,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 10:34:48,394 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:48,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 10:34:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 10:34:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-19 10:34:48,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 6 [2024-11-19 10:34:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:48,430 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-19 10:34:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-19 10:34:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:34:48,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:48,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:34:48,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:34:48,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-19 10:34:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933470452] [2024-11-19 10:34:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:48,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933470452] [2024-11-19 10:34:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933470452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:48,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:34:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129984458] [2024-11-19 10:34:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:34:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:34:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:34:48,523 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:48,562 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-19 10:34:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:34:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 10:34:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:48,564 INFO L225 Difference]: With dead ends: 34 [2024-11-19 10:34:48,564 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 10:34:48,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:34:48,565 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:48,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 10:34:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-19 10:34:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-19 10:34:48,573 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 6 [2024-11-19 10:34:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:48,573 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-19 10:34:48,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-19 10:34:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 10:34:48,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:48,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:48,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:34:48,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:48,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-19 10:34:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421665811] [2024-11-19 10:34:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:48,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421665811] [2024-11-19 10:34:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421665811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:34:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278846651] [2024-11-19 10:34:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:48,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:34:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:34:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:34:48,632 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:48,658 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-19 10:34:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:34:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 10:34:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:48,659 INFO L225 Difference]: With dead ends: 51 [2024-11-19 10:34:48,660 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 10:34:48,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:34:48,661 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:48,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 10:34:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 10:34:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-19 10:34:48,667 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2024-11-19 10:34:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:48,667 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-19 10:34:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-19 10:34:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 10:34:48,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:48,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:48,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:34:48,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:48,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1510249073, now seen corresponding path program 1 times [2024-11-19 10:34:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645194842] [2024-11-19 10:34:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645194842] [2024-11-19 10:34:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645194842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:34:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032855235] [2024-11-19 10:34:48,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:48,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:34:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:48,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:34:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:34:48,788 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-19 10:34:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:48,846 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-19 10:34:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:34:48,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-19 10:34:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:48,848 INFO L225 Difference]: With dead ends: 32 [2024-11-19 10:34:48,848 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 10:34:48,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:34:48,849 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:48,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 10:34:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 10:34:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-19 10:34:48,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 11 [2024-11-19 10:34:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:48,858 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-19 10:34:48,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-11-19 10:34:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-19 10:34:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:34:48,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:48,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:34:48,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 426919062, now seen corresponding path program 1 times [2024-11-19 10:34:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021838945] [2024-11-19 10:34:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021838945] [2024-11-19 10:34:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021838945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:34:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256753834] [2024-11-19 10:34:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:34:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:34:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:34:48,957 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:49,013 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-19 10:34:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 10:34:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 10:34:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:49,018 INFO L225 Difference]: With dead ends: 41 [2024-11-19 10:34:49,019 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 10:34:49,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:34:49,020 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 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-11-19 10:34:49,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 10:34:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-19 10:34:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-19 10:34:49,031 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 12 [2024-11-19 10:34:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:49,031 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-19 10:34:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-19 10:34:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:34:49,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:49,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:49,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:34:49,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 426957791, now seen corresponding path program 1 times [2024-11-19 10:34:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941089468] [2024-11-19 10:34:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941089468] [2024-11-19 10:34:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941089468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:34:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142638726] [2024-11-19 10:34:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:49,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:34:49,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:34:49,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:34:49,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:34:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:49,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:34:49,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:34:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:34:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142638726] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:34:49,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:34:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-19 10:34:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930284394] [2024-11-19 10:34:49,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:34:49,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 10:34:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 10:34:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 10:34:49,213 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:49,317 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2024-11-19 10:34:49,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 10:34:49,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 12 [2024-11-19 10:34:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:49,320 INFO L225 Difference]: With dead ends: 74 [2024-11-19 10:34:49,320 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 10:34:49,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-19 10:34:49,321 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:49,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 10:34:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-11-19 10:34:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 10:34:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-19 10:34:49,331 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 12 [2024-11-19 10:34:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:49,332 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-19 10:34:49,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-19 10:34:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 10:34:49,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:49,334 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:49,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:34:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 10:34:49,538 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 850134625, now seen corresponding path program 1 times [2024-11-19 10:34:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510418043] [2024-11-19 10:34:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510418043] [2024-11-19 10:34:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510418043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:34:49,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900468989] [2024-11-19 10:34:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:49,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:34:49,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:34:49,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:34:49,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:34:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:49,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 10:34:49,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:34:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:34:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:49,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900468989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:34:49,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:34:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-19 10:34:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793444704] [2024-11-19 10:34:49,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:34:49,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:34:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:34:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:34:49,765 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:53,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:34:58,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:34:59,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:34:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:59,161 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2024-11-19 10:34:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 10:34:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-11-19 10:34:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:59,162 INFO L225 Difference]: With dead ends: 80 [2024-11-19 10:34:59,162 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 10:34:59,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2024-11-19 10:34:59,163 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:59,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 172 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-19 10:34:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 10:34:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2024-11-19 10:34:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:34:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-19 10:34:59,177 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 17 [2024-11-19 10:34:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:59,177 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-19 10:34:59,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:34:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-19 10:34:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:34:59,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:59,181 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-19 10:34:59,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 10:34:59,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 10:34:59,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -924745014, now seen corresponding path program 2 times [2024-11-19 10:34:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731745997] [2024-11-19 10:34:59,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:34:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:59,406 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:34:59,407 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:34:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 10:34:59,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731745997] [2024-11-19 10:34:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731745997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:34:59,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:34:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:34:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634327198] [2024-11-19 10:34:59,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:34:59,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:34:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:34:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:34:59,480 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-19 10:34:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:34:59,519 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2024-11-19 10:34:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:34:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 27 [2024-11-19 10:34:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:34:59,520 INFO L225 Difference]: With dead ends: 73 [2024-11-19 10:34:59,521 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 10:34:59,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:34:59,521 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:34:59,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:34:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 10:34:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-11-19 10:34:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:34:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-11-19 10:34:59,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 27 [2024-11-19 10:34:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:34:59,531 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-11-19 10:34:59,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-19 10:34:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-11-19 10:34:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 10:34:59,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:34:59,532 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:34:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:34:59,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:34:59,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:34:59,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1551419110, now seen corresponding path program 1 times [2024-11-19 10:34:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:34:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817213011] [2024-11-19 10:34:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:34:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:34:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817213011] [2024-11-19 10:34:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817213011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:34:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562575947] [2024-11-19 10:34:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:34:59,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:34:59,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:34:59,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:34:59,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 10:34:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:34:59,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 10:34:59,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:34:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:59,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:34:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:34:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562575947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:34:59,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:34:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-19 10:34:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420833586] [2024-11-19 10:34:59,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:34:59,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:34:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:34:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:34:59,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:34:59,869 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:00,013 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2024-11-19 10:35:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 10:35:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 10:35:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:00,014 INFO L225 Difference]: With dead ends: 98 [2024-11-19 10:35:00,014 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 10:35:00,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-11-19 10:35:00,015 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:00,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 210 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 10:35:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2024-11-19 10:35:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:35:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-19 10:35:00,025 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 31 [2024-11-19 10:35:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:00,025 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-19 10:35:00,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-19 10:35:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:35:00,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:00,027 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:00,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 10:35:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:00,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -847775146, now seen corresponding path program 2 times [2024-11-19 10:35:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696941898] [2024-11-19 10:35:00,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:00,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 10:35:00,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-19 10:35:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696941898] [2024-11-19 10:35:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696941898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140559105] [2024-11-19 10:35:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:00,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:00,273 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-19 10:35:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:00,323 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2024-11-19 10:35:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:35:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 32 [2024-11-19 10:35:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:00,324 INFO L225 Difference]: With dead ends: 77 [2024-11-19 10:35:00,324 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 10:35:00,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:35:00,324 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:00,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:35:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 10:35:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2024-11-19 10:35:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:35:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-19 10:35:00,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 32 [2024-11-19 10:35:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:00,330 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-19 10:35:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-19 10:35:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-19 10:35:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:35:00,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:00,331 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:35:00,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1436603759, now seen corresponding path program 2 times [2024-11-19 10:35:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96532226] [2024-11-19 10:35:00,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:00,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:00,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96532226] [2024-11-19 10:35:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96532226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:00,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952125091] [2024-11-19 10:35:00,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:00,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:00,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:00,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 10:35:00,604 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:00,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:00,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 10:35:00,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:00,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:35:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952125091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:01,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2024-11-19 10:35:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542050981] [2024-11-19 10:35:01,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:01,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 10:35:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 10:35:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2024-11-19 10:35:01,013 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:01,424 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2024-11-19 10:35:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 10:35:01,424 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 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 36 [2024-11-19 10:35:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:01,426 INFO L225 Difference]: With dead ends: 101 [2024-11-19 10:35:01,426 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 10:35:01,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=1784, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 10:35:01,428 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 136 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:01,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 182 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 10:35:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 69. [2024-11-19 10:35:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 10:35:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-19 10:35:01,440 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 36 [2024-11-19 10:35:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:01,440 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-19 10:35:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-19 10:35:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 10:35:01,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:01,442 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:01,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 10:35:01,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:01,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1919738262, now seen corresponding path program 1 times [2024-11-19 10:35:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179812508] [2024-11-19 10:35:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 10:35:01,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179812508] [2024-11-19 10:35:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179812508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724355843] [2024-11-19 10:35:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:01,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:01,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 10:35:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:01,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 10:35:01,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 10:35:02,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 10:35:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724355843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:02,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2024-11-19 10:35:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179258326] [2024-11-19 10:35:02,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 10:35:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 10:35:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-19 10:35:02,228 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-19 10:35:06,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:35:11,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 10:35:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:11,974 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2024-11-19 10:35:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 10:35:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 84 [2024-11-19 10:35:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:11,977 INFO L225 Difference]: With dead ends: 172 [2024-11-19 10:35:11,977 INFO L226 Difference]: Without dead ends: 171 [2024-11-19 10:35:11,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=820, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 10:35:11,978 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:11,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 197 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-11-19 10:35:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-19 10:35:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2024-11-19 10:35:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 90 states have internal predecessors, (103), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 10:35:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2024-11-19 10:35:12,001 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 84 [2024-11-19 10:35:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:12,002 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2024-11-19 10:35:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-19 10:35:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2024-11-19 10:35:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 10:35:12,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:12,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:12,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 10:35:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 10:35:12,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1801430346, now seen corresponding path program 1 times [2024-11-19 10:35:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483272144] [2024-11-19 10:35:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 10:35:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483272144] [2024-11-19 10:35:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483272144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876949884] [2024-11-19 10:35:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:12,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:12,463 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:12,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 10:35:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:12,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:35:12,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 10:35:12,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 10:35:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876949884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:12,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:12,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2024-11-19 10:35:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395825525] [2024-11-19 10:35:12,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:12,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 10:35:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 10:35:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-11-19 10:35:12,986 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-19 10:35:15,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 10:35:19,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 10:35:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:19,948 INFO L93 Difference]: Finished difference Result 305 states and 407 transitions. [2024-11-19 10:35:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-19 10:35:19,949 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 94 [2024-11-19 10:35:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:19,951 INFO L225 Difference]: With dead ends: 305 [2024-11-19 10:35:19,951 INFO L226 Difference]: Without dead ends: 304 [2024-11-19 10:35:19,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=674, Invalid=2188, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 10:35:19,953 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 175 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:19,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 233 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-19 10:35:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-19 10:35:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 139. [2024-11-19 10:35:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 10:35:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2024-11-19 10:35:19,978 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 94 [2024-11-19 10:35:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:19,979 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2024-11-19 10:35:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.08) internal successors, (77), 26 states have internal predecessors, (77), 4 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-19 10:35:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2024-11-19 10:35:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 10:35:19,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:19,982 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:19,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 10:35:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:20,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1484553230, now seen corresponding path program 1 times [2024-11-19 10:35:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612339237] [2024-11-19 10:35:20,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:20,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-19 10:35:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612339237] [2024-11-19 10:35:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612339237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:35:20,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316070195] [2024-11-19 10:35:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:35:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:35:20,463 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:35:20,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 10:35:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:35:20,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 10:35:20,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:35:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-19 10:35:20,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:35:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-19 10:35:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316070195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:35:20,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:35:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 14 [2024-11-19 10:35:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604131272] [2024-11-19 10:35:20,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:35:20,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 10:35:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:20,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 10:35:20,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-19 10:35:20,765 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 10:35:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:20,978 INFO L93 Difference]: Finished difference Result 203 states and 266 transitions. [2024-11-19 10:35:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 10:35:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-19 10:35:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:20,983 INFO L225 Difference]: With dead ends: 203 [2024-11-19 10:35:20,983 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 10:35:20,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-19 10:35:20,984 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:20,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 204 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:35:20,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 10:35:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2024-11-19 10:35:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.1333333333333333) internal successors, (102), 90 states have internal predecessors, (102), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 10:35:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 174 transitions. [2024-11-19 10:35:20,995 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 174 transitions. Word has length 113 [2024-11-19 10:35:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:20,995 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 174 transitions. [2024-11-19 10:35:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 10:35:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 174 transitions. [2024-11-19 10:35:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 10:35:20,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:35:20,997 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:21,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 10:35:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:35:21,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-19 10:35:21,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:35:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -715554241, now seen corresponding path program 2 times [2024-11-19 10:35:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:35:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454186027] [2024-11-19 10:35:21,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 10:35:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:35:21,219 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 10:35:21,219 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 10:35:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-11-19 10:35:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:35:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454186027] [2024-11-19 10:35:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454186027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:35:21,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:35:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:35:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009422979] [2024-11-19 10:35:21,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:35:21,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:35:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:35:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:35:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:35:21,341 INFO L87 Difference]: Start difference. First operand 133 states and 174 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 10:35:25,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 10:35:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:35:25,430 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2024-11-19 10:35:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:35:25,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 135 [2024-11-19 10:35:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:35:25,431 INFO L225 Difference]: With dead ends: 137 [2024-11-19 10:35:25,431 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:35:25,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:35:25,433 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:35:25,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 77 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-19 10:35:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:35:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:35:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:35:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:35:25,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2024-11-19 10:35:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:35:25,434 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:35:25,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 10:35:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:35:25,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:35:25,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-19 10:35:25,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-19 10:35:25,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-19 10:35:25,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-19 10:35:25,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 10:35:25,442 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:35:25,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:35:27,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:35:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:35:27 BoogieIcfgContainer [2024-11-19 10:35:27,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:35:27,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:35:27,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:35:27,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:35:27,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:48" (3/4) ... [2024-11-19 10:35:27,483 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:35:27,486 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 10:35:27,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 10:35:27,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:35:27,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:35:27,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:35:27,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:35:27,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:35:27,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:35:27,553 INFO L158 Benchmark]: Toolchain (without parser) took 40036.74ms. Allocated memory was 155.2MB in the beginning and 255.9MB in the end (delta: 100.7MB). Free memory was 99.7MB in the beginning and 185.9MB in the end (delta: -86.3MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,554 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:35:27,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.15ms. Allocated memory is still 155.2MB. Free memory was 99.7MB in the beginning and 86.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.27ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,554 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,555 INFO L158 Benchmark]: RCFGBuilder took 286.04ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 67.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,555 INFO L158 Benchmark]: TraceAbstraction took 39353.50ms. Allocated memory was 155.2MB in the beginning and 255.9MB in the end (delta: 100.7MB). Free memory was 125.6MB in the beginning and 191.2MB in the end (delta: -65.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,555 INFO L158 Benchmark]: Witness Printer took 71.92ms. Allocated memory is still 255.9MB. Free memory was 191.2MB in the beginning and 185.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 10:35:27,556 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.11ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.15ms. Allocated memory is still 155.2MB. Free memory was 99.7MB in the beginning and 86.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.27ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.04ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 67.1MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 39353.50ms. Allocated memory was 155.2MB in the beginning and 255.9MB in the end (delta: 100.7MB). Free memory was 125.6MB in the beginning and 191.2MB in the end (delta: -65.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. * Witness Printer took 71.92ms. Allocated memory is still 255.9MB. Free memory was 191.2MB in the beginning and 185.9MB 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 15, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 2005 SdHoareTripleChecker+Invalid, 29.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1555 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 450 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 976 GetRequests, 705 SyntacticMatches, 21 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=13, InterpolantAutomatonStates: 218, 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, 15 MinimizatonAttempts, 300 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1368 ConstructedInterpolants, 0 QuantifiedInterpolants, 2886 SizeOfPredicates, 59 NumberOfNonLiveVariables, 953 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 3203/4031 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 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((counter == 3) || (counter == 5)) || (counter == 4)) || (counter == 0)) || (counter == 1)) || (counter == 2)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483644) && (1 <= counter)) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-19 10:35:27,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE