./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for overflows
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.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 c60dc3ce59c2c65912da9b7b458247bdc42b4524b29b39bec7ce63758c18c031
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 10:18:19,592 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 10:18:19,671 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf
[2024-11-19 10:18:19,678 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 10:18:19,679 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 10:18:19,710 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 10:18:19,711 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 10:18:19,712 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 10:18:19,712 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 10:18:19,714 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 10:18:19,715 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 10:18:19,715 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 10:18:19,715 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 10:18:19,716 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 10:18:19,716 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 10:18:19,716 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 10:18:19,717 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-19 10:18:19,717 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 10:18:19,721 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 10:18:19,721 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 10:18:19,721 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 10:18:19,722 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-19 10:18:19,722 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 10:18:19,722 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-19 10:18:19,722 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 10:18:19,723 INFO  L153        SettingsManager]:  * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-19 10:18:19,723 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-19 10:18:19,723 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 10:18:19,723 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-19 10:18:19,723 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 10:18:19,724 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 10:18:19,724 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 10:18:19,724 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 10:18:19,724 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 10:18:19,725 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 10:18:19,725 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 10:18:19,727 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 10:18:19,728 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-19 10:18:19,728 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 10:18:19,728 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 10:18:19,728 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 10:18:19,729 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 10:18:19,729 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 10:18:19,729 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 10:18:19,729 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 -> c60dc3ce59c2c65912da9b7b458247bdc42b4524b29b39bec7ce63758c18c031
[2024-11-19 10:18:20,018 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 10:18:20,049 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 10:18:20,053 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 10:18:20,054 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 10:18:20,055 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 10:18:20,057 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c
[2024-11-19 10:18:21,469 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 10:18:21,644 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 10:18:21,644 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c
[2024-11-19 10:18:21,652 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d68262e/466ffe9c5dd0430290373cd4e38deeb3/FLAGf21604161
[2024-11-19 10:18:21,665 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d68262e/466ffe9c5dd0430290373cd4e38deeb3
[2024-11-19 10:18:21,668 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 10:18:21,669 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 10:18:21,670 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 10:18:21,670 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 10:18:21,678 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 10:18:21,678 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,679 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34eb0932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21, skipping insertion in model container
[2024-11-19 10:18:21,680 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,700 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 10:18:21,893 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 10:18:21,906 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 10:18:21,924 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 10:18:21,941 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 10:18:21,942 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21 WrapperNode
[2024-11-19 10:18:21,942 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 10:18:21,943 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 10:18:21,943 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 10:18:21,943 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 10:18:21,950 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,957 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,974 INFO  L138                Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2024-11-19 10:18:21,976 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 10:18:21,977 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 10:18:21,977 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 10:18:21,977 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 10:18:21,987 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,987 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:21,993 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,007 INFO  L175           MemorySlicer]: Split 3 memory accesses to 2 slices as follows [2, 1]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 1 writes are split as follows [1, 0].
[2024-11-19 10:18:22,007 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,008 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,012 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,015 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,016 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,017 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,018 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 10:18:22,019 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 10:18:22,020 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 10:18:22,020 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 10:18:22,020 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (1/1) ...
[2024-11-19 10:18:22,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 10:18:22,037 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:22,055 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-19 10:18:22,057 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-19 10:18:22,106 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-19 10:18:22,106 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-19 10:18:22,106 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 10:18:22,106 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 10:18:22,107 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-19 10:18:22,107 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-19 10:18:22,107 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-19 10:18:22,107 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-19 10:18:22,185 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 10:18:22,189 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 10:18:22,433 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-11-19 10:18:22,434 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 10:18:22,451 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 10:18:22,451 INFO  L316             CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-19 10:18:22,452 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:22 BoogieIcfgContainer
[2024-11-19 10:18:22,452 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 10:18:22,455 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 10:18:22,456 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 10:18:22,459 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 10:18:22,460 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:21" (1/3) ...
[2024-11-19 10:18:22,461 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:22, skipping insertion in model container
[2024-11-19 10:18:22,462 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:21" (2/3) ...
[2024-11-19 10:18:22,462 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:22, skipping insertion in model container
[2024-11-19 10:18:22,462 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:22" (3/3) ...
[2024-11-19 10:18:22,464 INFO  L112   eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5.c
[2024-11-19 10:18:22,514 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 10:18:22,514 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-11-19 10:18:22,584 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 10:18:22,591 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;@702d9da4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 10:18:22,592 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-19 10:18:22,597 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 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-19 10:18:22,603 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-19 10:18:22,603 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:22,604 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:22,604 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:22,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:22,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 889666572, now seen corresponding path program 1 times
[2024-11-19 10:18:22,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:22,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537171084]
[2024-11-19 10:18:22,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:22,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:22,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:22,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:22,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:22,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537171084]
[2024-11-19 10:18:22,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537171084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:18:22,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:18:22,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 10:18:22,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8084184]
[2024-11-19 10:18:22,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:18:22,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 10:18:22,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:22,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 10:18:22,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:18:22,989 INFO  L87              Difference]: Start difference. First operand  has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 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) Second operand  has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:23,090 INFO  L93              Difference]: Finished difference Result 64 states and 83 transitions.
[2024-11-19 10:18:23,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 10:18:23,094 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-19 10:18:23,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:23,100 INFO  L225             Difference]: With dead ends: 64
[2024-11-19 10:18:23,100 INFO  L226             Difference]: Without dead ends: 32
[2024-11-19 10:18:23,102 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-19 10:18:23,105 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:23,106 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:23,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-19 10:18:23,128 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26.
[2024-11-19 10:18:23,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 20 states have (on average 1.4) internal successors, (28), 25 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-19 10:18:23,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions.
[2024-11-19 10:18:23,131 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 6
[2024-11-19 10:18:23,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:23,131 INFO  L471      AbstractCegarLoop]: Abstraction has 26 states and 28 transitions.
[2024-11-19 10:18:23,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions.
[2024-11-19 10:18:23,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-19 10:18:23,132 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:23,132 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:23,133 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 10:18:23,133 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:23,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:23,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 269484748, now seen corresponding path program 1 times
[2024-11-19 10:18:23,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:23,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779403028]
[2024-11-19 10:18:23,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:23,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:23,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:23,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:23,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:23,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779403028]
[2024-11-19 10:18:23,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779403028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:18:23,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:18:23,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 10:18:23,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146993429]
[2024-11-19 10:18:23,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:18:23,227 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 10:18:23,228 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:23,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 10:18:23,229 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:18:23,229 INFO  L87              Difference]: Start difference. First operand 26 states and 28 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-19 10:18:23,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:23,280 INFO  L93              Difference]: Finished difference Result 36 states and 38 transitions.
[2024-11-19 10:18:23,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 10:18:23,281 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-19 10:18:23,281 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:23,282 INFO  L225             Difference]: With dead ends: 36
[2024-11-19 10:18:23,282 INFO  L226             Difference]: Without dead ends: 34
[2024-11-19 10:18:23,282 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-19 10:18:23,283 INFO  L432           NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:23,284 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:18:23,285 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2024-11-19 10:18:23,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31.
[2024-11-19 10:18:23,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions.
[2024-11-19 10:18:23,291 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 8
[2024-11-19 10:18:23,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:23,293 INFO  L471      AbstractCegarLoop]: Abstraction has 31 states and 33 transitions.
[2024-11-19 10:18:23,293 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-19 10:18:23,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions.
[2024-11-19 10:18:23,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-19 10:18:23,295 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:23,295 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:23,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 10:18:23,296 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:23,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:23,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 1131599168, now seen corresponding path program 1 times
[2024-11-19 10:18:23,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:23,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869050838]
[2024-11-19 10:18:23,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:23,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:23,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:23,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:23,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:23,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869050838]
[2024-11-19 10:18:23,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869050838] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:18:23,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:18:23,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 10:18:23,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317742536]
[2024-11-19 10:18:23,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:18:23,443 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 10:18:23,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:23,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 10:18:23,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:18:23,444 INFO  L87              Difference]: Start difference. First operand 31 states and 33 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,488 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:23,489 INFO  L93              Difference]: Finished difference Result 38 states and 41 transitions.
[2024-11-19 10:18:23,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 10:18:23,490 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-19 10:18:23,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:23,492 INFO  L225             Difference]: With dead ends: 38
[2024-11-19 10:18:23,492 INFO  L226             Difference]: Without dead ends: 36
[2024-11-19 10:18:23,493 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-19 10:18:23,494 INFO  L432           NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:23,495 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:18:23,495 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2024-11-19 10:18:23,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35.
[2024-11-19 10:18:23,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions.
[2024-11-19 10:18:23,500 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13
[2024-11-19 10:18:23,500 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:23,500 INFO  L471      AbstractCegarLoop]: Abstraction has 35 states and 38 transitions.
[2024-11-19 10:18:23,500 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions.
[2024-11-19 10:18:23,500 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-11-19 10:18:23,501 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:23,501 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:23,501 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 10:18:23,501 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:23,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:23,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 804002367, now seen corresponding path program 1 times
[2024-11-19 10:18:23,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:23,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077120810]
[2024-11-19 10:18:23,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:23,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:23,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:23,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:23,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:23,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077120810]
[2024-11-19 10:18:23,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077120810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:18:23,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 10:18:23,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 10:18:23,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158916179]
[2024-11-19 10:18:23,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:18:23,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 10:18:23,573 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:23,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 10:18:23,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:18:23,574 INFO  L87              Difference]: Start difference. First operand 35 states and 38 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,619 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:23,619 INFO  L93              Difference]: Finished difference Result 42 states and 45 transitions.
[2024-11-19 10:18:23,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 10:18:23,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15
[2024-11-19 10:18:23,620 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:23,622 INFO  L225             Difference]: With dead ends: 42
[2024-11-19 10:18:23,622 INFO  L226             Difference]: Without dead ends: 40
[2024-11-19 10:18:23,623 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 10:18:23,624 INFO  L432           NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:23,627 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:18:23,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2024-11-19 10:18:23,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40.
[2024-11-19 10:18:23,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 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-19 10:18:23,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions.
[2024-11-19 10:18:23,636 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15
[2024-11-19 10:18:23,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:23,636 INFO  L471      AbstractCegarLoop]: Abstraction has 40 states and 43 transitions.
[2024-11-19 10:18:23,637 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:23,637 INFO  L276                IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions.
[2024-11-19 10:18:23,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-11-19 10:18:23,637 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:23,638 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1]
[2024-11-19 10:18:23,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 10:18:23,638 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:23,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:23,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 838475520, now seen corresponding path program 1 times
[2024-11-19 10:18:23,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:23,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437466582]
[2024-11-19 10:18:23,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:23,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:23,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:23,771 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-19 10:18:23,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:23,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437466582]
[2024-11-19 10:18:23,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437466582] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:23,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445204546]
[2024-11-19 10:18:23,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:23,773 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:23,774 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:23,777 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:23,779 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-19 10:18:23,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:23,874 INFO  L255         TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:23,881 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:23,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:23,974 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:24,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:24,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445204546] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:24,039 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:24,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10
[2024-11-19 10:18:24,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134227106]
[2024-11-19 10:18:24,040 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:24,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-19 10:18:24,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:24,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-19 10:18:24,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-19 10:18:24,047 INFO  L87              Difference]: Start difference. First operand 40 states and 43 transitions. Second operand  has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:24,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:24,178 INFO  L93              Difference]: Finished difference Result 70 states and 77 transitions.
[2024-11-19 10:18:24,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-19 10:18:24,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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 15
[2024-11-19 10:18:24,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:24,180 INFO  L225             Difference]: With dead ends: 70
[2024-11-19 10:18:24,180 INFO  L226             Difference]: Without dead ends: 39
[2024-11-19 10:18:24,181 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-11-19 10:18:24,182 INFO  L432           NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:24,185 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:24,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2024-11-19 10:18:24,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2024-11-19 10:18:24,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:24,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions.
[2024-11-19 10:18:24,191 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 15
[2024-11-19 10:18:24,191 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:24,191 INFO  L471      AbstractCegarLoop]: Abstraction has 39 states and 41 transitions.
[2024-11-19 10:18:24,192 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:24,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions.
[2024-11-19 10:18:24,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-11-19 10:18:24,193 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:24,193 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:24,210 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-19 10:18:24,397 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:24,398 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:24,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:24,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -140543044, now seen corresponding path program 1 times
[2024-11-19 10:18:24,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:24,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694358306]
[2024-11-19 10:18:24,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:24,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:24,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:24,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:24,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:24,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694358306]
[2024-11-19 10:18:24,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694358306] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:24,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763188252]
[2024-11-19 10:18:24,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:24,488 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:24,488 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:24,491 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:24,494 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-19 10:18:24,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:24,556 INFO  L255         TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:24,558 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:24,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:24,671 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:24,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 10:18:24,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763188252] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:24,783 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:24,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15
[2024-11-19 10:18:24,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39788679]
[2024-11-19 10:18:24,783 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:24,784 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-19 10:18:24,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:24,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-19 10:18:24,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210
[2024-11-19 10:18:24,785 INFO  L87              Difference]: Start difference. First operand 39 states and 41 transitions. Second operand  has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:25,010 INFO  L93              Difference]: Finished difference Result 77 states and 84 transitions.
[2024-11-19 10:18:25,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-11-19 10:18:25,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2024-11-19 10:18:25,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:25,011 INFO  L225             Difference]: With dead ends: 77
[2024-11-19 10:18:25,011 INFO  L226             Difference]: Without dead ends: 47
[2024-11-19 10:18:25,011 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420
[2024-11-19 10:18:25,012 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:25,012 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:25,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2024-11-19 10:18:25,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44.
[2024-11-19 10:18:25,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions.
[2024-11-19 10:18:25,018 INFO  L78                 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 17
[2024-11-19 10:18:25,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:25,018 INFO  L471      AbstractCegarLoop]: Abstraction has 44 states and 47 transitions.
[2024-11-19 10:18:25,019 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,019 INFO  L276                IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions.
[2024-11-19 10:18:25,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-19 10:18:25,019 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:25,020 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:25,034 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-19 10:18:25,223 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,SelfDestructingSolverStorable5
[2024-11-19 10:18:25,224 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:25,224 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:25,224 INFO  L85        PathProgramCache]: Analyzing trace with hash -1304654107, now seen corresponding path program 1 times
[2024-11-19 10:18:25,224 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:25,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48682030]
[2024-11-19 10:18:25,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:25,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:25,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:25,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:25,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:25,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48682030]
[2024-11-19 10:18:25,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48682030] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:25,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940038434]
[2024-11-19 10:18:25,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:25,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:25,331 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:25,333 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:25,335 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-19 10:18:25,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:25,392 INFO  L255         TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:25,393 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:25,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:25,423 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 10:18:25,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [940038434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 10:18:25,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-19 10:18:25,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7
[2024-11-19 10:18:25,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635521360]
[2024-11-19 10:18:25,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 10:18:25,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 10:18:25,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:25,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 10:18:25,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-19 10:18:25,425 INFO  L87              Difference]: Start difference. First operand 44 states and 47 transitions. Second operand  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:25,480 INFO  L93              Difference]: Finished difference Result 44 states and 47 transitions.
[2024-11-19 10:18:25,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 10:18:25,481 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2024-11-19 10:18:25,481 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:25,481 INFO  L225             Difference]: With dead ends: 44
[2024-11-19 10:18:25,481 INFO  L226             Difference]: Without dead ends: 43
[2024-11-19 10:18:25,482 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-19 10:18:25,482 INFO  L432           NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:25,482 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:18:25,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2024-11-19 10:18:25,487 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2024-11-19 10:18:25,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions.
[2024-11-19 10:18:25,488 INFO  L78                 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20
[2024-11-19 10:18:25,488 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:25,488 INFO  L471      AbstractCegarLoop]: Abstraction has 43 states and 46 transitions.
[2024-11-19 10:18:25,489 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:25,489 INFO  L276                IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions.
[2024-11-19 10:18:25,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-19 10:18:25,489 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:25,489 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:25,506 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-19 10:18:25,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:25,691 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:25,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:25,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 625719622, now seen corresponding path program 1 times
[2024-11-19 10:18:25,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:25,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306617595]
[2024-11-19 10:18:25,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:25,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:25,707 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:25,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:25,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:25,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306617595]
[2024-11-19 10:18:25,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306617595] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:25,815 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375690079]
[2024-11-19 10:18:25,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:25,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:25,816 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:25,817 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:25,819 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-19 10:18:25,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:25,881 INFO  L255         TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:25,882 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:25,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:25,930 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:25,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:25,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375690079] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:25,993 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:25,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12
[2024-11-19 10:18:25,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505211214]
[2024-11-19 10:18:25,994 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:25,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-19 10:18:25,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:25,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-19 10:18:25,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156
[2024-11-19 10:18:25,995 INFO  L87              Difference]: Start difference. First operand 43 states and 46 transitions. Second operand  has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:26,078 INFO  L93              Difference]: Finished difference Result 49 states and 54 transitions.
[2024-11-19 10:18:26,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-11-19 10:18:26,079 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20
[2024-11-19 10:18:26,079 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:26,079 INFO  L225             Difference]: With dead ends: 49
[2024-11-19 10:18:26,080 INFO  L226             Difference]: Without dead ends: 48
[2024-11-19 10:18:26,080 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2024-11-19 10:18:26,081 INFO  L432           NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:26,081 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:26,081 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-11-19 10:18:26,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42.
[2024-11-19 10:18:26,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions.
[2024-11-19 10:18:26,085 INFO  L78                 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20
[2024-11-19 10:18:26,085 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:26,086 INFO  L471      AbstractCegarLoop]: Abstraction has 42 states and 45 transitions.
[2024-11-19 10:18:26,086 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,086 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions.
[2024-11-19 10:18:26,086 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-19 10:18:26,086 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:26,087 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:26,104 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-19 10:18:26,290 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:26,291 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:26,291 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:26,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -1789571562, now seen corresponding path program 1 times
[2024-11-19 10:18:26,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:26,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475383924]
[2024-11-19 10:18:26,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:26,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:26,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:26,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:26,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:26,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475383924]
[2024-11-19 10:18:26,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475383924] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:26,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140114991]
[2024-11-19 10:18:26,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:26,351 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:26,351 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:26,353 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:26,355 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-19 10:18:26,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:26,418 INFO  L255         TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:26,419 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:26,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:26,450 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:26,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-19 10:18:26,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140114991] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:26,498 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:26,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11
[2024-11-19 10:18:26,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474845619]
[2024-11-19 10:18:26,498 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:26,498 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-19 10:18:26,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:26,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-19 10:18:26,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2024-11-19 10:18:26,499 INFO  L87              Difference]: Start difference. First operand 42 states and 45 transitions. Second operand  has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:26,558 INFO  L93              Difference]: Finished difference Result 48 states and 52 transitions.
[2024-11-19 10:18:26,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-19 10:18:26,558 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 21
[2024-11-19 10:18:26,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:26,559 INFO  L225             Difference]: With dead ends: 48
[2024-11-19 10:18:26,559 INFO  L226             Difference]: Without dead ends: 30
[2024-11-19 10:18:26,560 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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-19 10:18:26,561 INFO  L432           NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:26,562 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 79 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:26,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2024-11-19 10:18:26,565 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2024-11-19 10:18:26,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2024-11-19 10:18:26,565 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 21
[2024-11-19 10:18:26,566 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:26,566 INFO  L471      AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2024-11-19 10:18:26,566 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:26,566 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2024-11-19 10:18:26,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2024-11-19 10:18:26,568 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:26,568 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1]
[2024-11-19 10:18:26,585 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-19 10:18:26,772 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:26,773 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:26,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:26,773 INFO  L85        PathProgramCache]: Analyzing trace with hash -745131094, now seen corresponding path program 1 times
[2024-11-19 10:18:26,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:26,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563211]
[2024-11-19 10:18:26,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:26,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:26,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:26,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-19 10:18:26,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:26,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563211]
[2024-11-19 10:18:26,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563211] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:26,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837675015]
[2024-11-19 10:18:26,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 10:18:26,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:26,845 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:26,847 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:26,848 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-19 10:18:26,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 10:18:26,920 INFO  L255         TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:26,921 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:26,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-19 10:18:26,952 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:26,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-19 10:18:27,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [837675015] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:27,000 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:27,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11
[2024-11-19 10:18:27,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483207010]
[2024-11-19 10:18:27,001 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:27,001 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-19 10:18:27,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:27,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-19 10:18:27,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2024-11-19 10:18:27,021 INFO  L87              Difference]: Start difference. First operand 30 states and 31 transitions. Second operand  has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:27,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:27,068 INFO  L93              Difference]: Finished difference Result 46 states and 52 transitions.
[2024-11-19 10:18:27,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-19 10:18:27,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29
[2024-11-19 10:18:27,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:27,071 INFO  L225             Difference]: With dead ends: 46
[2024-11-19 10:18:27,071 INFO  L226             Difference]: Without dead ends: 45
[2024-11-19 10:18:27,072 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 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-19 10:18:27,072 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:27,073 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 10:18:27,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2024-11-19 10:18:27,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42.
[2024-11-19 10:18:27,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:27,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions.
[2024-11-19 10:18:27,079 INFO  L78                 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29
[2024-11-19 10:18:27,079 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:27,079 INFO  L471      AbstractCegarLoop]: Abstraction has 42 states and 46 transitions.
[2024-11-19 10:18:27,079 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:27,080 INFO  L276                IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions.
[2024-11-19 10:18:27,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-11-19 10:18:27,083 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-19 10:18:27,083 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1]
[2024-11-19 10:18:27,102 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-19 10:18:27,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:27,285 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] ===
[2024-11-19 10:18:27,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 10:18:27,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 909367990, now seen corresponding path program 2 times
[2024-11-19 10:18:27,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 10:18:27,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078691310]
[2024-11-19 10:18:27,286 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 10:18:27,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 10:18:27,316 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 10:18:27,317 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 10:18:27,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked.
[2024-11-19 10:18:27,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 10:18:27,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078691310]
[2024-11-19 10:18:27,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078691310] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 10:18:27,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738284511]
[2024-11-19 10:18:27,440 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 10:18:27,440 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:27,441 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 10:18:27,442 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-19 10:18:27,444 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-19 10:18:27,533 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 10:18:27,534 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 10:18:27,535 INFO  L255         TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-19 10:18:27,538 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 10:18:27,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2024-11-19 10:18:27,663 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 10:18:27,814 INFO  L134       CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2024-11-19 10:18:27,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738284511] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 10:18:27,815 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-19 10:18:27,815 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 21
[2024-11-19 10:18:27,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648708708]
[2024-11-19 10:18:27,815 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-19 10:18:27,816 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-11-19 10:18:27,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 10:18:27,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-19 10:18:27,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2024-11-19 10:18:27,817 INFO  L87              Difference]: Start difference. First operand 42 states and 46 transitions. Second operand  has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:28,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 10:18:28,120 INFO  L93              Difference]: Finished difference Result 72 states and 81 transitions.
[2024-11-19 10:18:28,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2024-11-19 10:18:28,120 INFO  L78                 Accepts]: Start accepts. Automaton has  has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41
[2024-11-19 10:18:28,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 10:18:28,121 INFO  L225             Difference]: With dead ends: 72
[2024-11-19 10:18:28,122 INFO  L226             Difference]: Without dead ends: 0
[2024-11-19 10:18:28,123 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482
[2024-11-19 10:18:28,124 INFO  L432           NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 10:18:28,124 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 10:18:28,124 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-19 10:18:28,124 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-19 10:18:28,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:28,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-19 10:18:28,125 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41
[2024-11-19 10:18:28,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-19 10:18:28,125 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-19 10:18:28,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 21 states have (on average 3.761904761904762) internal successors, (79), 22 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 10:18:28,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-19 10:18:28,125 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-19 10:18:28,130 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining)
[2024-11-19 10:18:28,131 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining)
[2024-11-19 10:18:28,131 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining)
[2024-11-19 10:18:28,131 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining)
[2024-11-19 10:18:28,131 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining)
[2024-11-19 10:18:28,132 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining)
[2024-11-19 10:18:28,149 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-19 10:18:28,335 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-19 10:18:28,339 INFO  L407         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 10:18:28,343 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-19 10:18:28,485 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 10:18:28,501 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:18:28 BoogieIcfgContainer
[2024-11-19 10:18:28,502 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 10:18:28,503 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 10:18:28,503 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 10:18:28,503 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 10:18:28,503 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:22" (3/4) ...
[2024-11-19 10:18:28,506 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-19 10:18:28,515 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-19 10:18:28,515 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-19 10:18:28,515 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges
[2024-11-19 10:18:28,516 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-19 10:18:28,610 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-19 10:18:28,610 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-19 10:18:28,610 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 10:18:28,611 INFO  L158              Benchmark]: Toolchain (without parser) took 6942.14ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 126.1MB in the beginning and 84.6MB in the end (delta: 41.5MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,611 INFO  L158              Benchmark]: CDTParser took 1.08ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 99.2MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 10:18:28,611 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 272.39ms. Allocated memory is still 180.4MB. Free memory was 125.6MB in the beginning and 114.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,612 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.18ms. Allocated memory is still 180.4MB. Free memory was 114.0MB in the beginning and 112.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 10:18:28,612 INFO  L158              Benchmark]: Boogie Preprocessor took 42.09ms. Allocated memory is still 180.4MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,612 INFO  L158              Benchmark]: RCFGBuilder took 432.60ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 148.4MB in the end (delta: -38.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,613 INFO  L158              Benchmark]: TraceAbstraction took 6046.80ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 148.4MB in the beginning and 89.8MB in the end (delta: 58.7MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,613 INFO  L158              Benchmark]: Witness Printer took 107.75ms. Allocated memory is still 228.6MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 10:18:28,614 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.08ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 99.2MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 272.39ms. Allocated memory is still 180.4MB. Free memory was 125.6MB in the beginning and 114.0MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.18ms. Allocated memory is still 180.4MB. Free memory was 114.0MB in the beginning and 112.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 42.09ms. Allocated memory is still 180.4MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 432.60ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 148.4MB in the end (delta: -38.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6046.80ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 148.4MB in the beginning and 89.8MB in the end (delta: 58.7MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB.
 * Witness Printer took 107.75ms. Allocated memory is still 228.6MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 15]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 15]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 25]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 25]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 29]: integer overflow can never occur
    For all program executions holds that integer overflow can never occur at this location
  - PositiveResult [Line: 29]: 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, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 461 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 828 IncrementalHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 151 mSDtfsCounter, 828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 252 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=6, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 1153 SizeOfPredicates, 7 NumberOfNonLiveVariables, 787 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 230/418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    6 specifications checked. All of them hold
  - InvariantResult [Line: 15]: Loop Invariant
    Derived loop invariant: (((((i == 0) && (size == 0)) && (i == 0)) || (((((i <= 2147483646) && (size <= 31)) && (1 <= i)) && (1 <= i)) && (i <= 2147483645))) || (((((size <= 31) && (1 <= i)) && (i == 0)) && (1 <= size)) && (i <= 2147483645)))
  - InvariantResult [Line: 25]: Loop Invariant
    Derived loop invariant: ((i == 0) || ((i <= 2147483646) && (1 <= i)))
  - InvariantResult [Line: 29]: Loop Invariant
    Derived loop invariant: ((i == 0) || ((i <= 2147483646) && (1 <= i)))
RESULT: Ultimate proved your program to be correct!
[2024-11-19 10:18:28,643 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE