./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mbpr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/array-tiling/mbpr3.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 a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:30:01,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:30:01,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:30:01,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:30:01,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:30:01,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:30:01,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:30:01,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:30:01,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:30:01,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:30:01,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:30:01,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:30:01,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:30:01,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:30:01,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:30:01,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:30:01,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:30:01,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:30:01,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:30:01,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:30:01,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:30:01,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:30:01,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:30:01,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:30:01,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:30:01,479 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:30:01,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:30:01,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:30:01,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:30:01,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:30:01,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:30:01,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:30:01,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:30:01,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:30:01,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:01,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:30:01,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:30:01,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:30:01,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:30:01,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:30:01,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:30:01,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:30:01,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:30:01,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:30:01,489 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 -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2024-11-10 18:30:01,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:30:01,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:30:01,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:30:01,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:30:01,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:30:01,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr3.c [2024-11-10 18:30:03,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:30:03,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:30:03,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2024-11-10 18:30:03,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc579d46/ce7feccebe2b4a9cb527f900b82088b3/FLAGe9de02bcc [2024-11-10 18:30:03,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bc579d46/ce7feccebe2b4a9cb527f900b82088b3 [2024-11-10 18:30:03,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:30:03,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:30:03,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:03,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:30:03,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:30:03,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6e9698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03, skipping insertion in model container [2024-11-10 18:30:03,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:30:03,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:03,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:30:03,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:30:03,829 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:30:03,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03 WrapperNode [2024-11-10 18:30:03,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:30:03,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:03,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:30:03,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:30:03,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,888 INFO L138 Inliner]: procedures = 15, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2024-11-10 18:30:03,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:30:03,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:30:03,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:30:03,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:30:03,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,924 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 8, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 12 writes are split as follows [0, 0, 12]. [2024-11-10 18:30:03,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:30:03,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:30:03,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:30:03,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:30:03,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (1/1) ... [2024-11-10 18:30:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:30:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:03,990 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-10 18:30:03,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:30:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:30:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:30:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:30:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:30:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:30:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:30:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:30:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:30:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:30:04,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:30:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:30:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:30:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:30:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:30:04,151 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:30:04,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:30:04,607 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-10 18:30:04,608 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:30:04,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:30:04,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:30:04,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:04 BoogieIcfgContainer [2024-11-10 18:30:04,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:30:04,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:30:04,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:30:04,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:30:04,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:30:03" (1/3) ... [2024-11-10 18:30:04,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6987bf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:04, skipping insertion in model container [2024-11-10 18:30:04,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:30:03" (2/3) ... [2024-11-10 18:30:04,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6987bf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:30:04, skipping insertion in model container [2024-11-10 18:30:04,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:04" (3/3) ... [2024-11-10 18:30:04,655 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2024-11-10 18:30:04,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:30:04,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2024-11-10 18:30:04,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:30:04,758 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;@27b4dce9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:30:04,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-11-10 18:30:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 132 states have (on average 1.7727272727272727) internal successors, (234), 218 states have internal predecessors, (234), 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-10 18:30:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:04,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:04,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:04,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1089442755, now seen corresponding path program 1 times [2024-11-10 18:30:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822752708] [2024-11-10 18:30:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:05,010 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-10 18:30:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822752708] [2024-11-10 18:30:05,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822752708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:05,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:05,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032496224] [2024-11-10 18:30:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:30:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:30:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:30:05,049 INFO L87 Difference]: Start difference. First operand has 219 states, 132 states have (on average 1.7727272727272727) internal successors, (234), 218 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:05,089 INFO L93 Difference]: Finished difference Result 432 states and 459 transitions. [2024-11-10 18:30:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:30:05,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 18:30:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:05,100 INFO L225 Difference]: With dead ends: 432 [2024-11-10 18:30:05,100 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 18:30:05,104 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-10 18:30:05,107 INFO L432 NwaCegarLoop]: 227 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, 227 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-10 18:30:05,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:30:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 18:30:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-10 18:30:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 211 states have internal predecessors, (219), 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-10 18:30:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 219 transitions. [2024-11-10 18:30:05,151 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 219 transitions. Word has length 8 [2024-11-10 18:30:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:05,152 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 219 transitions. [2024-11-10 18:30:05,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 219 transitions. [2024-11-10 18:30:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 18:30:05,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:05,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:05,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:30:05,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:05,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:05,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1089412964, now seen corresponding path program 1 times [2024-11-10 18:30:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501758841] [2024-11-10 18:30:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:05,374 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-10 18:30:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:05,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501758841] [2024-11-10 18:30:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501758841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:05,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:05,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199177058] [2024-11-10 18:30:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:05,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:05,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:05,383 INFO L87 Difference]: Start difference. First operand 212 states and 219 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:05,462 INFO L93 Difference]: Finished difference Result 212 states and 219 transitions. [2024-11-10 18:30:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 18:30:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:05,465 INFO L225 Difference]: With dead ends: 212 [2024-11-10 18:30:05,465 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 18:30:05,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:05,469 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 418 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:05,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 199 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 18:30:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 18:30:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 208 states have internal predecessors, (216), 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-10 18:30:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 216 transitions. [2024-11-10 18:30:05,485 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 216 transitions. Word has length 8 [2024-11-10 18:30:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:05,485 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 216 transitions. [2024-11-10 18:30:05,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 216 transitions. [2024-11-10 18:30:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 18:30:05,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:05,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:30:05,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 587936675, now seen corresponding path program 1 times [2024-11-10 18:30:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528620970] [2024-11-10 18:30:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:05,809 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-10 18:30:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528620970] [2024-11-10 18:30:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528620970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:30:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785134220] [2024-11-10 18:30:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:05,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:05,812 INFO L87 Difference]: Start difference. First operand 209 states and 216 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:05,884 INFO L93 Difference]: Finished difference Result 209 states and 216 transitions. [2024-11-10 18:30:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:05,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 18:30:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:05,886 INFO L225 Difference]: With dead ends: 209 [2024-11-10 18:30:05,886 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 18:30:05,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:05,888 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 410 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:05,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 198 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 18:30:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-10 18:30:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 205 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 213 transitions. [2024-11-10 18:30:05,905 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 213 transitions. Word has length 9 [2024-11-10 18:30:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:05,905 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 213 transitions. [2024-11-10 18:30:05,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 213 transitions. [2024-11-10 18:30:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 18:30:05,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:05,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:05,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:30:05,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:05,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:05,911 INFO L85 PathProgramCache]: Analyzing trace with hash 345040400, now seen corresponding path program 1 times [2024-11-10 18:30:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002367138] [2024-11-10 18:30:05,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:05,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:05,971 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-10 18:30:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002367138] [2024-11-10 18:30:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002367138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:05,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:30:05,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259045105] [2024-11-10 18:30:05,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:05,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:30:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:30:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:05,973 INFO L87 Difference]: Start difference. First operand 206 states and 213 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:06,356 INFO L93 Difference]: Finished difference Result 377 states and 390 transitions. [2024-11-10 18:30:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:30:06,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 18:30:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:06,358 INFO L225 Difference]: With dead ends: 377 [2024-11-10 18:30:06,360 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 18:30:06,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:06,362 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 94 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:06,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 161 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 18:30:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 18:30:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2024-11-10 18:30:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 222 states have (on average 1.4189189189189189) internal successors, (315), 301 states have internal predecessors, (315), 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-10 18:30:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2024-11-10 18:30:06,388 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 12 [2024-11-10 18:30:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:06,388 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2024-11-10 18:30:06,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2024-11-10 18:30:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 18:30:06,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:06,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:06,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:30:06,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:06,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 315327181, now seen corresponding path program 1 times [2024-11-10 18:30:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293968224] [2024-11-10 18:30:06,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:06,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:06,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-10 18:30:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293968224] [2024-11-10 18:30:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293968224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867919060] [2024-11-10 18:30:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:06,520 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-10 18:30:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:06,723 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2024-11-10 18:30:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 18:30:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:06,727 INFO L225 Difference]: With dead ends: 313 [2024-11-10 18:30:06,727 INFO L226 Difference]: Without dead ends: 311 [2024-11-10 18:30:06,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:06,731 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:06,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-10 18:30:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 310. [2024-11-10 18:30:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 230 states have (on average 1.4086956521739131) internal successors, (324), 309 states have internal predecessors, (324), 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-10 18:30:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 324 transitions. [2024-11-10 18:30:06,756 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 324 transitions. Word has length 28 [2024-11-10 18:30:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 324 transitions. [2024-11-10 18:30:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-10 18:30:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 324 transitions. [2024-11-10 18:30:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 18:30:06,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:06,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:06,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:30:06,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1353612471, now seen corresponding path program 1 times [2024-11-10 18:30:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533638044] [2024-11-10 18:30:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:06,852 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-10 18:30:06,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533638044] [2024-11-10 18:30:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533638044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:06,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980940399] [2024-11-10 18:30:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:06,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:06,854 INFO L87 Difference]: Start difference. First operand 310 states and 324 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:07,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:07,220 INFO L93 Difference]: Finished difference Result 318 states and 332 transitions. [2024-11-10 18:30:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:07,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-10 18:30:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:07,224 INFO L225 Difference]: With dead ends: 318 [2024-11-10 18:30:07,224 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 18:30:07,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:07,226 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 74 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:07,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 273 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 18:30:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2024-11-10 18:30:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 312 states have internal predecessors, (327), 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-10 18:30:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 327 transitions. [2024-11-10 18:30:07,239 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 327 transitions. Word has length 35 [2024-11-10 18:30:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:07,240 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 327 transitions. [2024-11-10 18:30:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 327 transitions. [2024-11-10 18:30:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 18:30:07,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:07,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:30:07,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:07,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash -699166428, now seen corresponding path program 1 times [2024-11-10 18:30:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345877218] [2024-11-10 18:30:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 18:30:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345877218] [2024-11-10 18:30:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345877218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:30:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991675176] [2024-11-10 18:30:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:07,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:07,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:07,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:07,501 INFO L87 Difference]: Start difference. First operand 313 states and 327 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10 18:30:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:07,820 INFO L93 Difference]: Finished difference Result 525 states and 549 transitions. [2024-11-10 18:30:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:07,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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 37 [2024-11-10 18:30:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:07,822 INFO L225 Difference]: With dead ends: 525 [2024-11-10 18:30:07,822 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 18:30:07,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:30:07,823 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 402 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:07,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 145 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 18:30:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2024-11-10 18:30:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 233 states have (on average 1.390557939914163) internal successors, (324), 312 states have internal predecessors, (324), 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-10 18:30:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 324 transitions. [2024-11-10 18:30:07,831 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 324 transitions. Word has length 37 [2024-11-10 18:30:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:07,832 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 324 transitions. [2024-11-10 18:30:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10 18:30:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 324 transitions. [2024-11-10 18:30:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 18:30:07,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:07,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:07,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:30:07,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2004919354, now seen corresponding path program 1 times [2024-11-10 18:30:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234507662] [2024-11-10 18:30:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234507662] [2024-11-10 18:30:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234507662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791008549] [2024-11-10 18:30:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:07,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:07,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:07,941 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-10 18:30:07,942 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-10 18:30:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:08,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:08,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:08,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791008549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 18:30:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888849869] [2024-11-10 18:30:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:08,119 INFO L87 Difference]: Start difference. First operand 313 states and 324 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:08,468 INFO L93 Difference]: Finished difference Result 315 states and 326 transitions. [2024-11-10 18:30:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 18:30:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:08,470 INFO L225 Difference]: With dead ends: 315 [2024-11-10 18:30:08,470 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 18:30:08,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:08,471 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:08,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 245 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 18:30:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2024-11-10 18:30:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 233 states have (on average 1.3347639484978542) internal successors, (311), 299 states have internal predecessors, (311), 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-10 18:30:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 311 transitions. [2024-11-10 18:30:08,485 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 311 transitions. Word has length 43 [2024-11-10 18:30:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:08,486 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 311 transitions. [2024-11-10 18:30:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 311 transitions. [2024-11-10 18:30:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 18:30:08,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:08,488 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:08,508 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-10 18:30:08,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:08,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:08,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2022958004, now seen corresponding path program 1 times [2024-11-10 18:30:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651311640] [2024-11-10 18:30:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:08,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651311640] [2024-11-10 18:30:08,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651311640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:08,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050559420] [2024-11-10 18:30:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:08,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:08,784 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-10 18:30:08,786 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-10 18:30:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:08,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:08,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:08,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:30:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050559420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:09,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-10 18:30:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796894172] [2024-11-10 18:30:09,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:30:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:09,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:30:09,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:09,002 INFO L87 Difference]: Start difference. First operand 300 states and 311 transitions. Second operand has 10 states, 9 states have (on average 12.777777777777779) internal successors, (115), 10 states have internal predecessors, (115), 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-10 18:30:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:09,530 INFO L93 Difference]: Finished difference Result 351 states and 378 transitions. [2024-11-10 18:30:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:30:09,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.777777777777779) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-10 18:30:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:09,534 INFO L225 Difference]: With dead ends: 351 [2024-11-10 18:30:09,534 INFO L226 Difference]: Without dead ends: 318 [2024-11-10 18:30:09,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:09,535 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 250 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:09,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 332 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 18:30:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-10 18:30:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2024-11-10 18:30:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 277 states have (on average 1.187725631768953) internal successors, (329), 313 states have internal predecessors, (329), 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-10 18:30:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 329 transitions. [2024-11-10 18:30:09,549 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 329 transitions. Word has length 44 [2024-11-10 18:30:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:09,549 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 329 transitions. [2024-11-10 18:30:09,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.777777777777779) internal successors, (115), 10 states have internal predecessors, (115), 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-10 18:30:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 329 transitions. [2024-11-10 18:30:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 18:30:09,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:09,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:09,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:30:09,754 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,SelfDestructingSolverStorable8 [2024-11-10 18:30:09,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1863933766, now seen corresponding path program 1 times [2024-11-10 18:30:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278981302] [2024-11-10 18:30:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278981302] [2024-11-10 18:30:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278981302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313860712] [2024-11-10 18:30:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:09,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:09,836 INFO L87 Difference]: Start difference. First operand 314 states and 329 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:10,073 INFO L93 Difference]: Finished difference Result 323 states and 338 transitions. [2024-11-10 18:30:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 18:30:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:10,076 INFO L225 Difference]: With dead ends: 323 [2024-11-10 18:30:10,076 INFO L226 Difference]: Without dead ends: 321 [2024-11-10 18:30:10,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:10,077 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 74 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:10,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 192 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-10 18:30:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-11-10 18:30:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 281 states have (on average 1.1850533807829182) internal successors, (333), 317 states have internal predecessors, (333), 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-10 18:30:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 333 transitions. [2024-11-10 18:30:10,085 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 333 transitions. Word has length 71 [2024-11-10 18:30:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 333 transitions. [2024-11-10 18:30:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 333 transitions. [2024-11-10 18:30:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 18:30:10,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:10,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:10,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:30:10,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1979699511, now seen corresponding path program 1 times [2024-11-10 18:30:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634185780] [2024-11-10 18:30:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634185780] [2024-11-10 18:30:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634185780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602636615] [2024-11-10 18:30:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:10,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:10,188 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-10 18:30:10,189 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-10 18:30:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:10,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:10,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:10,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602636615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 18:30:10,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882690214] [2024-11-10 18:30:10,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:10,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:10,318 INFO L87 Difference]: Start difference. First operand 318 states and 333 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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-10 18:30:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:10,604 INFO L93 Difference]: Finished difference Result 320 states and 335 transitions. [2024-11-10 18:30:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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 79 [2024-11-10 18:30:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:10,606 INFO L225 Difference]: With dead ends: 320 [2024-11-10 18:30:10,606 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 18:30:10,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:10,607 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 100 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:10,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 178 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 18:30:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2024-11-10 18:30:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 281 states have (on average 1.1387900355871887) internal successors, (320), 304 states have internal predecessors, (320), 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-10 18:30:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 320 transitions. [2024-11-10 18:30:10,614 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 320 transitions. Word has length 79 [2024-11-10 18:30:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:10,614 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 320 transitions. [2024-11-10 18:30:10,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 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-10 18:30:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 320 transitions. [2024-11-10 18:30:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 18:30:10,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:10,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:10,633 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-10 18:30:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:10,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1241142803, now seen corresponding path program 1 times [2024-11-10 18:30:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251485961] [2024-11-10 18:30:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251485961] [2024-11-10 18:30:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251485961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156568034] [2024-11-10 18:30:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:10,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:10,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:10,902 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-10 18:30:10,904 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-10 18:30:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:10,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:10,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:11,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 18:30:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156568034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:11,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-10 18:30:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805719172] [2024-11-10 18:30:11,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:30:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:30:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:11,117 INFO L87 Difference]: Start difference. First operand 305 states and 320 transitions. Second operand has 10 states, 9 states have (on average 16.444444444444443) internal successors, (148), 10 states have internal predecessors, (148), 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-10 18:30:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:11,450 INFO L93 Difference]: Finished difference Result 356 states and 377 transitions. [2024-11-10 18:30:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:30:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.444444444444443) internal successors, (148), 10 states have internal predecessors, (148), 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 80 [2024-11-10 18:30:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:11,452 INFO L225 Difference]: With dead ends: 356 [2024-11-10 18:30:11,452 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 18:30:11,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:30:11,453 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 256 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:11,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 261 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 18:30:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2024-11-10 18:30:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 327 states have (on average 1.1314984709480123) internal successors, (370), 350 states have internal predecessors, (370), 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-10 18:30:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 370 transitions. [2024-11-10 18:30:11,460 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 370 transitions. Word has length 80 [2024-11-10 18:30:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:11,460 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 370 transitions. [2024-11-10 18:30:11,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.444444444444443) internal successors, (148), 10 states have internal predecessors, (148), 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-10 18:30:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 370 transitions. [2024-11-10 18:30:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 18:30:11,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:11,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 18:30:11,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:11,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:11,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1249730842, now seen corresponding path program 1 times [2024-11-10 18:30:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045180329] [2024-11-10 18:30:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 18:30:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:11,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045180329] [2024-11-10 18:30:11,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045180329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:11,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:11,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:11,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458867319] [2024-11-10 18:30:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:11,748 INFO L87 Difference]: Start difference. First operand 351 states and 370 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:11,914 INFO L93 Difference]: Finished difference Result 351 states and 370 transitions. [2024-11-10 18:30:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:11,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 18:30:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:11,916 INFO L225 Difference]: With dead ends: 351 [2024-11-10 18:30:11,916 INFO L226 Difference]: Without dead ends: 350 [2024-11-10 18:30:11,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:11,917 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 85 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:11,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 138 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-10 18:30:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-10 18:30:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 327 states have (on average 1.128440366972477) internal successors, (369), 349 states have internal predecessors, (369), 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-10 18:30:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 369 transitions. [2024-11-10 18:30:11,925 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 369 transitions. Word has length 98 [2024-11-10 18:30:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:11,925 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 369 transitions. [2024-11-10 18:30:11,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 369 transitions. [2024-11-10 18:30:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 18:30:11,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:11,927 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:11,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:30:11,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -630481292, now seen corresponding path program 2 times [2024-11-10 18:30:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:11,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717895716] [2024-11-10 18:30:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-10 18:30:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717895716] [2024-11-10 18:30:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717895716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876838924] [2024-11-10 18:30:12,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:12,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:12,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:12,217 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-10 18:30:12,217 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-10 18:30:12,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:12,272 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:12,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:12,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-10 18:30:12,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-10 18:30:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876838924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:12,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2024-11-10 18:30:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567578684] [2024-11-10 18:30:12,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:12,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:30:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:30:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:30:12,852 INFO L87 Difference]: Start difference. First operand 350 states and 369 transitions. Second operand has 9 states, 8 states have (on average 14.375) internal successors, (115), 9 states have internal predecessors, (115), 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-10 18:30:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:13,040 INFO L93 Difference]: Finished difference Result 350 states and 369 transitions. [2024-11-10 18:30:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:30:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 14.375) internal successors, (115), 9 states have internal predecessors, (115), 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 106 [2024-11-10 18:30:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:13,042 INFO L225 Difference]: With dead ends: 350 [2024-11-10 18:30:13,043 INFO L226 Difference]: Without dead ends: 344 [2024-11-10 18:30:13,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:30:13,044 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 486 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:13,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 59 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-10 18:30:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 257. [2024-11-10 18:30:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 240 states have (on average 1.1208333333333333) internal successors, (269), 256 states have internal predecessors, (269), 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-10 18:30:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 269 transitions. [2024-11-10 18:30:13,052 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 269 transitions. Word has length 106 [2024-11-10 18:30:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:13,053 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 269 transitions. [2024-11-10 18:30:13,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 14.375) internal successors, (115), 9 states have internal predecessors, (115), 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-10 18:30:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 269 transitions. [2024-11-10 18:30:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 18:30:13,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:13,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:13,071 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-10 18:30:13,254 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,SelfDestructingSolverStorable13 [2024-11-10 18:30:13,255 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:13,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -375502909, now seen corresponding path program 1 times [2024-11-10 18:30:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295173199] [2024-11-10 18:30:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:30:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295173199] [2024-11-10 18:30:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295173199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:13,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849561483] [2024-11-10 18:30:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:30:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:30:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:13,370 INFO L87 Difference]: Start difference. First operand 257 states and 269 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-10 18:30:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:13,383 INFO L93 Difference]: Finished difference Result 336 states and 352 transitions. [2024-11-10 18:30:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:30:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 107 [2024-11-10 18:30:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:13,384 INFO L225 Difference]: With dead ends: 336 [2024-11-10 18:30:13,384 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 18:30:13,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:30:13,385 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:13,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:30:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 18:30:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-10 18:30:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 230 states have (on average 1.108695652173913) internal successors, (255), 244 states have internal predecessors, (255), 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-10 18:30:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 255 transitions. [2024-11-10 18:30:13,393 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 255 transitions. Word has length 107 [2024-11-10 18:30:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:13,394 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 255 transitions. [2024-11-10 18:30:13,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-10 18:30:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 255 transitions. [2024-11-10 18:30:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 18:30:13,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:13,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:13,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:30:13,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:13,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 912242779, now seen corresponding path program 1 times [2024-11-10 18:30:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517361922] [2024-11-10 18:30:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:30:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517361922] [2024-11-10 18:30:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517361922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:13,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659811829] [2024-11-10 18:30:13,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:13,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:13,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:13,504 INFO L87 Difference]: Start difference. First operand 245 states and 255 transitions. Second operand has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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-10 18:30:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:13,720 INFO L93 Difference]: Finished difference Result 281 states and 292 transitions. [2024-11-10 18:30:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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 107 [2024-11-10 18:30:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:13,723 INFO L225 Difference]: With dead ends: 281 [2024-11-10 18:30:13,723 INFO L226 Difference]: Without dead ends: 279 [2024-11-10 18:30:13,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:13,724 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 68 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:13,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 143 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-10 18:30:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 249. [2024-11-10 18:30:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 234 states have (on average 1.106837606837607) internal successors, (259), 248 states have internal predecessors, (259), 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-10 18:30:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 259 transitions. [2024-11-10 18:30:13,733 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 259 transitions. Word has length 107 [2024-11-10 18:30:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:13,734 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 259 transitions. [2024-11-10 18:30:13,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 4 states have internal predecessors, (101), 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-10 18:30:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 259 transitions. [2024-11-10 18:30:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 18:30:13,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:13,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 18:30:13,736 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1855644532, now seen corresponding path program 1 times [2024-11-10 18:30:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545978418] [2024-11-10 18:30:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:30:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545978418] [2024-11-10 18:30:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545978418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50869634] [2024-11-10 18:30:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:13,870 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-10 18:30:13,871 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-10 18:30:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:13,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:13,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 18:30:14,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50869634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-10 18:30:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926778676] [2024-11-10 18:30:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:14,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:30:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:14,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:30:14,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:14,013 INFO L87 Difference]: Start difference. First operand 249 states and 259 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 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-10 18:30:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:14,270 INFO L93 Difference]: Finished difference Result 278 states and 289 transitions. [2024-11-10 18:30:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:30:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-10 18:30:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:14,272 INFO L225 Difference]: With dead ends: 278 [2024-11-10 18:30:14,272 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 18:30:14,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:30:14,273 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:14,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 135 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 18:30:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2024-11-10 18:30:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 234 states have (on average 1.0598290598290598) internal successors, (248), 237 states have internal predecessors, (248), 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-10 18:30:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 248 transitions. [2024-11-10 18:30:14,279 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 248 transitions. Word has length 115 [2024-11-10 18:30:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:14,279 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 248 transitions. [2024-11-10 18:30:14,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 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-10 18:30:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 248 transitions. [2024-11-10 18:30:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 18:30:14,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:14,281 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:14,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 18:30:14,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -89600444, now seen corresponding path program 1 times [2024-11-10 18:30:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534435055] [2024-11-10 18:30:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:30:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534435055] [2024-11-10 18:30:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534435055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373432576] [2024-11-10 18:30:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:14,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:14,615 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-10 18:30:14,616 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-10 18:30:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:14,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:14,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:30:14,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:30:14,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373432576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:14,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:30:14,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 18:30:14,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675502304] [2024-11-10 18:30:14,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:14,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:30:14,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:14,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:30:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:14,750 INFO L87 Difference]: Start difference. First operand 238 states and 248 transitions. Second operand has 6 states, 5 states have (on average 24.2) internal successors, (121), 6 states have internal predecessors, (121), 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-10 18:30:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:14,978 INFO L93 Difference]: Finished difference Result 268 states and 279 transitions. [2024-11-10 18:30:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:30:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.2) internal successors, (121), 6 states have internal predecessors, (121), 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 130 [2024-11-10 18:30:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:14,980 INFO L225 Difference]: With dead ends: 268 [2024-11-10 18:30:14,980 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 18:30:14,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:30:14,981 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 97 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:14,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 143 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:30:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 18:30:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2024-11-10 18:30:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 234 states have (on average 1.0555555555555556) internal successors, (247), 236 states have internal predecessors, (247), 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-10 18:30:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 247 transitions. [2024-11-10 18:30:14,986 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 247 transitions. Word has length 130 [2024-11-10 18:30:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:14,987 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 247 transitions. [2024-11-10 18:30:14,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.2) internal successors, (121), 6 states have internal predecessors, (121), 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-10 18:30:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 247 transitions. [2024-11-10 18:30:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 18:30:14,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:14,988 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:15,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:15,191 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:15,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:15,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1517353507, now seen corresponding path program 1 times [2024-11-10 18:30:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:15,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986529110] [2024-11-10 18:30:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:30:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986529110] [2024-11-10 18:30:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986529110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305888184] [2024-11-10 18:30:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:15,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:30:15,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 18:30:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:15,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:30:15,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:30:15,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:30:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305888184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:15,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:15,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-10 18:30:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082893464] [2024-11-10 18:30:15,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:15,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:30:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:30:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:30:15,518 INFO L87 Difference]: Start difference. First operand 237 states and 247 transitions. Second operand has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 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-10 18:30:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:15,809 INFO L93 Difference]: Finished difference Result 294 states and 310 transitions. [2024-11-10 18:30:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:30:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 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 131 [2024-11-10 18:30:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:15,811 INFO L225 Difference]: With dead ends: 294 [2024-11-10 18:30:15,811 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 18:30:15,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:30:15,812 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 261 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:15,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 204 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 18:30:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 18:30:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2024-11-10 18:30:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 261 states have (on average 1.0613026819923372) internal successors, (277), 263 states have internal predecessors, (277), 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-10 18:30:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 277 transitions. [2024-11-10 18:30:15,818 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 277 transitions. Word has length 131 [2024-11-10 18:30:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 277 transitions. [2024-11-10 18:30:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 13.636363636363637) internal successors, (150), 12 states have internal predecessors, (150), 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-10 18:30:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 277 transitions. [2024-11-10 18:30:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-10 18:30:15,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:15,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:15,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:16,022 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:16,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -351735623, now seen corresponding path program 1 times [2024-11-10 18:30:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437692460] [2024-11-10 18:30:16,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-10 18:30:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437692460] [2024-11-10 18:30:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437692460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092386003] [2024-11-10 18:30:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:16,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:16,101 INFO L87 Difference]: Start difference. First operand 264 states and 277 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:16,240 INFO L93 Difference]: Finished difference Result 269 states and 283 transitions. [2024-11-10 18:30:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:16,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-10 18:30:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:16,241 INFO L225 Difference]: With dead ends: 269 [2024-11-10 18:30:16,242 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 18:30:16,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:16,242 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 79 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:16,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 110 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 18:30:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 196. [2024-11-10 18:30:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.0618556701030928) internal successors, (206), 195 states have internal predecessors, (206), 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-10 18:30:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 206 transitions. [2024-11-10 18:30:16,248 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 206 transitions. Word has length 134 [2024-11-10 18:30:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:16,248 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 206 transitions. [2024-11-10 18:30:16,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:30:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 206 transitions. [2024-11-10 18:30:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 18:30:16,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:16,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:16,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 18:30:16,250 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:16,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash 110118398, now seen corresponding path program 1 times [2024-11-10 18:30:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639998008] [2024-11-10 18:30:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:30:16,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639998008] [2024-11-10 18:30:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639998008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:30:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:30:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:30:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621319137] [2024-11-10 18:30:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:30:16,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:30:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:30:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:16,356 INFO L87 Difference]: Start difference. First operand 196 states and 206 transitions. Second operand has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 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-10 18:30:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:16,488 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2024-11-10 18:30:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:30:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 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 139 [2024-11-10 18:30:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:16,489 INFO L225 Difference]: With dead ends: 206 [2024-11-10 18:30:16,489 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 18:30:16,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:30:16,490 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 79 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:16,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 107 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:30:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 18:30:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2024-11-10 18:30:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.0654761904761905) internal successors, (179), 168 states have internal predecessors, (179), 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-10 18:30:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2024-11-10 18:30:16,496 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 139 [2024-11-10 18:30:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:16,496 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2024-11-10 18:30:16,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 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-10 18:30:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2024-11-10 18:30:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 18:30:16,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:30:16,498 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:16,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 18:30:16,498 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2024-11-10 18:30:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:30:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 550039578, now seen corresponding path program 2 times [2024-11-10 18:30:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:30:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24730028] [2024-11-10 18:30:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:30:16,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:30:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:30:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-10 18:30:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:30:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24730028] [2024-11-10 18:30:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24730028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:30:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260072546] [2024-11-10 18:30:17,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:30:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:30:17,192 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:30:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 18:30:17,275 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:30:17,276 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:30:17,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:30:17,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:30:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-10 18:30:17,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:30:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-10 18:30:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260072546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:30:17,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:30:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4, 4] total 18 [2024-11-10 18:30:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508810605] [2024-11-10 18:30:17,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:30:17,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 18:30:17,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:30:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 18:30:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:30:17,719 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 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-10 18:30:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:30:18,608 INFO L93 Difference]: Finished difference Result 462 states and 486 transitions. [2024-11-10 18:30:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 18:30:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 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 158 [2024-11-10 18:30:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:30:18,609 INFO L225 Difference]: With dead ends: 462 [2024-11-10 18:30:18,609 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 18:30:18,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 18:30:18,611 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 983 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 18:30:18,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 303 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 18:30:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 18:30:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 18:30:18,612 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-10 18:30:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 18:30:18,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2024-11-10 18:30:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:30:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 18:30:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 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-10 18:30:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 18:30:18,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 18:30:18,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 86 remaining) [2024-11-10 18:30:18,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 86 remaining) [2024-11-10 18:30:18,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 86 remaining) [2024-11-10 18:30:18,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 86 remaining) [2024-11-10 18:30:18,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 86 remaining) [2024-11-10 18:30:18,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 86 remaining) [2024-11-10 18:30:18,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 86 remaining) [2024-11-10 18:30:18,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 86 remaining) [2024-11-10 18:30:18,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 86 remaining) [2024-11-10 18:30:18,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 86 remaining) [2024-11-10 18:30:18,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 86 remaining) [2024-11-10 18:30:18,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 86 remaining) [2024-11-10 18:30:18,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 86 remaining) [2024-11-10 18:30:18,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 86 remaining) [2024-11-10 18:30:18,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 86 remaining) [2024-11-10 18:30:18,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 86 remaining) [2024-11-10 18:30:18,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 86 remaining) [2024-11-10 18:30:18,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 86 remaining) [2024-11-10 18:30:18,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 86 remaining) [2024-11-10 18:30:18,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 86 remaining) [2024-11-10 18:30:18,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 86 remaining) [2024-11-10 18:30:18,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 86 remaining) [2024-11-10 18:30:18,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 86 remaining) [2024-11-10 18:30:18,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 86 remaining) [2024-11-10 18:30:18,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 86 remaining) [2024-11-10 18:30:18,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 86 remaining) [2024-11-10 18:30:18,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 86 remaining) [2024-11-10 18:30:18,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 18:30:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:30:18,834 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:30:18,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 18:30:19,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:30:19,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:30:19 BoogieIcfgContainer [2024-11-10 18:30:19,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:30:19,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:30:19,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:30:19,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:30:19,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:30:04" (3/4) ... [2024-11-10 18:30:19,122 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:30:19,133 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-10 18:30:19,133 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 18:30:19,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:30:19,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:19,134 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:30:19,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:30:19,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:30:19,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:30:19,251 INFO L158 Benchmark]: Toolchain (without parser) took 15764.19ms. Allocated memory was 130.0MB in the beginning and 276.8MB in the end (delta: 146.8MB). Free memory was 59.2MB in the beginning and 241.1MB in the end (delta: -181.9MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,251 INFO L158 Benchmark]: CDTParser took 1.35ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 91.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.53ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 58.8MB in the beginning and 148.7MB in the end (delta: -89.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.43ms. Allocated memory is still 184.5MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,252 INFO L158 Benchmark]: Boogie Preprocessor took 53.87ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,253 INFO L158 Benchmark]: IcfgBuilder took 698.63ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 116.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,253 INFO L158 Benchmark]: TraceAbstraction took 14472.60ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 115.2MB in the beginning and 86.3MB in the end (delta: 28.8MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,253 INFO L158 Benchmark]: Witness Printer took 131.33ms. Allocated memory is still 276.8MB. Free memory was 86.3MB in the beginning and 241.1MB in the end (delta: -154.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-10 18:30:19,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 91.1MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.53ms. Allocated memory was 130.0MB in the beginning and 184.5MB in the end (delta: 54.5MB). Free memory was 58.8MB in the beginning and 148.7MB in the end (delta: -89.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.43ms. Allocated memory is still 184.5MB. Free memory was 148.7MB in the beginning and 146.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.87ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 698.63ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 116.2MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14472.60ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 115.2MB in the beginning and 86.3MB in the end (delta: 28.8MB). Peak memory consumption was 120.1MB. Max. memory is 16.1GB. * Witness Printer took 131.33ms. Allocated memory is still 276.8MB. Free memory was 86.3MB in the beginning and 241.1MB in the end (delta: -154.8MB). Peak memory consumption was 7.7MB. 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: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 67]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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 - 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 - 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 - 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 - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 219 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 22, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4473 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4473 mSDsluCounter, 4337 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2257 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7498 IncrementalHoareTripleChecker+Invalid, 7767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 2080 mSDtfsCounter, 7498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1506 GetRequests, 1390 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=12, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 335 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2565 NumberOfCodeBlocks, 2343 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3048 ConstructedInterpolants, 0 QuantifiedInterpolants, 8914 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1479 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 36 InterpolantComputations, 17 PerfectInterpolantSequences, 909/1099 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 86 specifications checked. All of them hold - InvariantResult [Line: 56]: Location Invariant Derived location invariant: null - InvariantResult [Line: 28]: Location Invariant Derived location invariant: null - InvariantResult [Line: 42]: Location Invariant Derived location invariant: null - InvariantResult [Line: 70]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 18:30:19,286 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