./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 154556615f003714b5a49b3ebe7e74b2231be519e4b6364e10c3e255a1a8cfe1
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-18 13:51:54,676 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-18 13:51:54,770 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-18 13:51:54,776 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-18 13:51:54,778 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-18 13:51:54,810 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-18 13:51:54,811 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-18 13:51:54,812 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-18 13:51:54,812 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-18 13:51:54,813 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-18 13:51:54,814 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-18 13:51:54,814 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-18 13:51:54,815 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-18 13:51:54,815 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-18 13:51:54,817 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-18 13:51:54,817 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-18 13:51:54,817 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-18 13:51:54,818 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-18 13:51:54,818 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-18 13:51:54,818 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-18 13:51:54,822 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-18 13:51:54,822 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-18 13:51:54,823 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-18 13:51:54,823 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-18 13:51:54,823 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-18 13:51:54,823 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-18 13:51:54,824 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-18 13:51:54,824 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-18 13:51:54,824 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-18 13:51:54,825 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-18 13:51:54,825 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-18 13:51:54,825 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-18 13:51:54,825 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 13:51:54,825 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-18 13:51:54,826 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-18 13:51:54,826 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-18 13:51:54,826 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-18 13:51:54,826 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-18 13:51:54,827 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-18 13:51:54,827 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-18 13:51:54,827 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-18 13:51:54,829 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-18 13:51:54,829 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 ! call(reach_error())) )


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 -> 154556615f003714b5a49b3ebe7e74b2231be519e4b6364e10c3e255a1a8cfe1
[2024-11-18 13:51:55,092 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-18 13:51:55,116 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-18 13:51:55,121 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-18 13:51:55,122 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-18 13:51:55,123 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-18 13:51:55,124 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c
[2024-11-18 13:51:56,605 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-18 13:51:56,810 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-18 13:51:56,811 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c
[2024-11-18 13:51:56,822 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18e4a9c5/708dadc02c194f2e8c16672602ebe1ff/FLAGd1c460472
[2024-11-18 13:51:57,174 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18e4a9c5/708dadc02c194f2e8c16672602ebe1ff
[2024-11-18 13:51:57,177 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-18 13:51:57,178 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-18 13:51:57,179 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-18 13:51:57,179 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-18 13:51:57,185 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-18 13:51:57,186 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,187 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cefcbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57, skipping insertion in model container
[2024-11-18 13:51:57,187 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,208 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-18 13:51:57,374 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c[524,537]
[2024-11-18 13:51:57,394 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 13:51:57,401 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-18 13:51:57,413 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound10.c[524,537]
[2024-11-18 13:51:57,422 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-18 13:51:57,436 INFO  L204         MainTranslator]: Completed translation
[2024-11-18 13:51:57,437 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57 WrapperNode
[2024-11-18 13:51:57,437 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-18 13:51:57,438 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-18 13:51:57,438 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-18 13:51:57,438 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-18 13:51:57,445 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,451 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,471 INFO  L138                Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60
[2024-11-18 13:51:57,471 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-18 13:51:57,472 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-18 13:51:57,472 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-18 13:51:57,472 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-18 13:51:57,483 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,483 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,484 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,495 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-18 13:51:57,495 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,495 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,500 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,507 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,508 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,509 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,515 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-18 13:51:57,516 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-18 13:51:57,516 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-18 13:51:57,516 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-18 13:51:57,517 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (1/1) ...
[2024-11-18 13:51:57,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-18 13:51:57,532 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:51:57,553 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-18 13:51:57,556 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-18 13:51:57,595 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-18 13:51:57,595 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-18 13:51:57,595 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-18 13:51:57,595 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-18 13:51:57,595 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-18 13:51:57,595 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-18 13:51:57,648 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-18 13:51:57,651 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-18 13:51:57,801 INFO  L?                        ?]: Removed 6 outVars from TransFormulas that were not future-live.
[2024-11-18 13:51:57,801 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-18 13:51:57,812 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-18 13:51:57,812 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-18 13:51:57,812 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:51:57 BoogieIcfgContainer
[2024-11-18 13:51:57,812 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-18 13:51:57,814 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-18 13:51:57,814 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-18 13:51:57,817 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-18 13:51:57,817 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:51:57" (1/3) ...
[2024-11-18 13:51:57,818 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd2cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:51:57, skipping insertion in model container
[2024-11-18 13:51:57,818 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:51:57" (2/3) ...
[2024-11-18 13:51:57,819 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bd2cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:51:57, skipping insertion in model container
[2024-11-18 13:51:57,819 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:51:57" (3/3) ...
[2024-11-18 13:51:57,820 INFO  L112   eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound10.c
[2024-11-18 13:51:57,835 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-18 13:51:57,835 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-18 13:51:57,918 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-18 13:51:57,924 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;@3a0ded26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-18 13:51:57,924 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-18 13:51:57,927 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-18 13:51:57,933 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2024-11-18 13:51:57,933 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:51:57,933 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:51:57,934 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:51:57,938 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:51:57,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times
[2024-11-18 13:51:57,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:51:57,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560390325]
[2024-11-18 13:51:57,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:57,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:51:58,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:51:58,068 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-18 13:51:58,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:51:58,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560390325]
[2024-11-18 13:51:58,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560390325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:51:58,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:51:58,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-18 13:51:58,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293078755]
[2024-11-18 13:51:58,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:51:58,076 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-18 13:51:58,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:51:58,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-18 13:51:58,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-18 13:51:58,094 INFO  L87              Difference]: Start difference. First operand  has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:51:58,107 INFO  L93              Difference]: Finished difference Result 43 states and 63 transitions.
[2024-11-18 13:51:58,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-18 13:51:58,109 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9
[2024-11-18 13:51:58,109 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:51:58,114 INFO  L225             Difference]: With dead ends: 43
[2024-11-18 13:51:58,114 INFO  L226             Difference]: Without dead ends: 19
[2024-11-18 13:51:58,116 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-18 13:51:58,119 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 13:51:58,121 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:51:58,132 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2024-11-18 13:51:58,144 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2024-11-18 13:51:58,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:51:58,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions.
[2024-11-18 13:51:58,147 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9
[2024-11-18 13:51:58,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:51:58,148 INFO  L471      AbstractCegarLoop]: Abstraction has 19 states and 25 transitions.
[2024-11-18 13:51:58,148 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions.
[2024-11-18 13:51:58,149 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-18 13:51:58,149 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:51:58,149 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:51:58,150 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-18 13:51:58,150 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:51:58,151 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:51:58,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times
[2024-11-18 13:51:58,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:51:58,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711220888]
[2024-11-18 13:51:58,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:58,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:51:58,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:51:58,265 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-18 13:51:58,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:51:58,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711220888]
[2024-11-18 13:51:58,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711220888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:51:58,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:51:58,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-18 13:51:58,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861221565]
[2024-11-18 13:51:58,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:51:58,268 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-18 13:51:58,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:51:58,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-18 13:51:58,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-18 13:51:58,270 INFO  L87              Difference]: Start difference. First operand 19 states and 25 transitions. Second operand  has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:51:58,289 INFO  L93              Difference]: Finished difference Result 29 states and 36 transitions.
[2024-11-18 13:51:58,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-18 13:51:58,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-18 13:51:58,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:51:58,291 INFO  L225             Difference]: With dead ends: 29
[2024-11-18 13:51:58,291 INFO  L226             Difference]: Without dead ends: 21
[2024-11-18 13:51:58,292 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-18 13:51:58,293 INFO  L432           NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 13:51:58,293 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:51:58,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2024-11-18 13:51:58,298 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2024-11-18 13:51:58,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:51:58,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions.
[2024-11-18 13:51:58,299 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10
[2024-11-18 13:51:58,299 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:51:58,300 INFO  L471      AbstractCegarLoop]: Abstraction has 21 states and 27 transitions.
[2024-11-18 13:51:58,300 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,300 INFO  L276                IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions.
[2024-11-18 13:51:58,300 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-18 13:51:58,301 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:51:58,301 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:51:58,301 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-18 13:51:58,301 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:51:58,302 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:51:58,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times
[2024-11-18 13:51:58,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:51:58,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205833427]
[2024-11-18 13:51:58,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:58,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:51:58,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:51:58,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089282888]
[2024-11-18 13:51:58,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:58,338 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:51:58,339 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:51:58,342 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-18 13:51:58,343 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-18 13:51:58,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:51:58,401 INFO  L255         TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-18 13:51:58,406 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:51:58,547 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-18 13:51:58,547 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 13:51:58,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:51:58,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205833427]
[2024-11-18 13:51:58,548 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:51:58,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089282888]
[2024-11-18 13:51:58,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089282888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:51:58,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:51:58,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-18 13:51:58,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390902005]
[2024-11-18 13:51:58,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:51:58,553 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-18 13:51:58,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:51:58,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-18 13:51:58,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-18 13:51:58,554 INFO  L87              Difference]: Start difference. First operand 21 states and 27 transitions. Second operand  has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:51:58,631 INFO  L93              Difference]: Finished difference Result 34 states and 45 transitions.
[2024-11-18 13:51:58,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-18 13:51:58,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-18 13:51:58,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:51:58,634 INFO  L225             Difference]: With dead ends: 34
[2024-11-18 13:51:58,635 INFO  L226             Difference]: Without dead ends: 32
[2024-11-18 13:51:58,635 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-18 13:51:58,637 INFO  L432           NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:51:58,639 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 13:51:58,640 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2024-11-18 13:51:58,645 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26.
[2024-11-18 13:51:58,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-18 13:51:58,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions.
[2024-11-18 13:51:58,647 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10
[2024-11-18 13:51:58,647 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:51:58,647 INFO  L471      AbstractCegarLoop]: Abstraction has 26 states and 32 transitions.
[2024-11-18 13:51:58,647 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-18 13:51:58,648 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions.
[2024-11-18 13:51:58,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-18 13:51:58,648 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:51:58,649 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:51:58,663 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-18 13:51:58,849 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:51:58,850 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:51:58,850 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:51:58,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times
[2024-11-18 13:51:58,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:51:58,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378903454]
[2024-11-18 13:51:58,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:58,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:51:58,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:51:58,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380469722]
[2024-11-18 13:51:58,871 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:58,871 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:51:58,871 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:51:58,873 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-18 13:51:58,875 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-18 13:51:58,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:51:58,929 INFO  L255         TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-18 13:51:58,931 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:51:59,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:51:59,194 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:51:59,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:51:59,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:51:59,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378903454]
[2024-11-18 13:51:59,404 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:51:59,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380469722]
[2024-11-18 13:51:59,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380469722] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:51:59,404 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-18 13:51:59,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14
[2024-11-18 13:51:59,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117867028]
[2024-11-18 13:51:59,405 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:51:59,407 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-18 13:51:59,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:51:59,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-18 13:51:59,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2024-11-18 13:51:59,411 INFO  L87              Difference]: Start difference. First operand 26 states and 32 transitions. Second operand  has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:51:59,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:51:59,691 INFO  L93              Difference]: Finished difference Result 47 states and 64 transitions.
[2024-11-18 13:51:59,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-11-18 13:51:59,692 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16
[2024-11-18 13:51:59,692 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:51:59,694 INFO  L225             Difference]: With dead ends: 47
[2024-11-18 13:51:59,694 INFO  L226             Difference]: Without dead ends: 45
[2024-11-18 13:51:59,695 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272
[2024-11-18 13:51:59,698 INFO  L432           NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-18 13:51:59,698 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 85 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-18 13:51:59,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2024-11-18 13:51:59,710 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31.
[2024-11-18 13:51:59,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4)
[2024-11-18 13:51:59,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions.
[2024-11-18 13:51:59,714 INFO  L78                 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16
[2024-11-18 13:51:59,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:51:59,715 INFO  L471      AbstractCegarLoop]: Abstraction has 31 states and 37 transitions.
[2024-11-18 13:51:59,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:51:59,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions.
[2024-11-18 13:51:59,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-18 13:51:59,716 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:51:59,716 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:51:59,734 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-18 13:51:59,916 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2024-11-18 13:51:59,917 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:51:59,917 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:51:59,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times
[2024-11-18 13:51:59,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:51:59,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423226713]
[2024-11-18 13:51:59,918 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:51:59,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:51:59,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:00,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:00,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:00,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423226713]
[2024-11-18 13:52:00,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423226713] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:52:00,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54833455]
[2024-11-18 13:52:00,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:00,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:00,087 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:00,088 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-18 13:52:00,108 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-18 13:52:00,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:00,205 INFO  L255         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:00,206 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:00,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:00,249 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:52:00,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:00,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [54833455] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:52:00,291 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:52:00,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8
[2024-11-18 13:52:00,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939224547]
[2024-11-18 13:52:00,292 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:52:00,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-18 13:52:00,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:00,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-18 13:52:00,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-18 13:52:00,295 INFO  L87              Difference]: Start difference. First operand 31 states and 37 transitions. Second operand  has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-18 13:52:00,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:00,395 INFO  L93              Difference]: Finished difference Result 95 states and 115 transitions.
[2024-11-18 13:52:00,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-11-18 13:52:00,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19
[2024-11-18 13:52:00,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:00,397 INFO  L225             Difference]: With dead ends: 95
[2024-11-18 13:52:00,398 INFO  L226             Difference]: Without dead ends: 85
[2024-11-18 13:52:00,400 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2024-11-18 13:52:00,401 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:00,402 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 133 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 13:52:00,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2024-11-18 13:52:00,423 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79.
[2024-11-18 13:52:00,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9)
[2024-11-18 13:52:00,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions.
[2024-11-18 13:52:00,427 INFO  L78                 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 19
[2024-11-18 13:52:00,428 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:00,431 INFO  L471      AbstractCegarLoop]: Abstraction has 79 states and 99 transitions.
[2024-11-18 13:52:00,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-18 13:52:00,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions.
[2024-11-18 13:52:00,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-18 13:52:00,432 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:00,432 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:00,449 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-18 13:52:00,633 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:00,633 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:00,634 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:00,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times
[2024-11-18 13:52:00,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:00,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444559710]
[2024-11-18 13:52:00,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:00,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:00,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:52:00,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359059939]
[2024-11-18 13:52:00,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:00,677 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:00,677 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:00,681 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-18 13:52:00,682 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-18 13:52:00,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:00,733 INFO  L255         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:00,735 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:01,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:01,073 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:52:02,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:02,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:02,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444559710]
[2024-11-18 13:52:02,280 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:52:02,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359059939]
[2024-11-18 13:52:02,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359059939] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:52:02,280 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-18 13:52:02,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16
[2024-11-18 13:52:02,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296040620]
[2024-11-18 13:52:02,280 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:52:02,281 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-18 13:52:02,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:02,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-18 13:52:02,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240
[2024-11-18 13:52:02,282 INFO  L87              Difference]: Start difference. First operand 79 states and 99 transitions. Second operand  has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:02,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:02,994 INFO  L93              Difference]: Finished difference Result 119 states and 156 transitions.
[2024-11-18 13:52:02,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-11-18 13:52:02,994 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19
[2024-11-18 13:52:02,995 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:02,996 INFO  L225             Difference]: With dead ends: 119
[2024-11-18 13:52:02,996 INFO  L226             Difference]: Without dead ends: 113
[2024-11-18 13:52:02,996 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342
[2024-11-18 13:52:02,997 INFO  L432           NwaCegarLoop]: 16 mSDtfsCounter, 64 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:02,997 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 114 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-18 13:52:02,998 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2024-11-18 13:52:03,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71.
[2024-11-18 13:52:03,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7)
[2024-11-18 13:52:03,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions.
[2024-11-18 13:52:03,016 INFO  L78                 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19
[2024-11-18 13:52:03,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:03,017 INFO  L471      AbstractCegarLoop]: Abstraction has 71 states and 88 transitions.
[2024-11-18 13:52:03,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:03,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions.
[2024-11-18 13:52:03,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-18 13:52:03,017 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:03,018 INFO  L215           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:03,034 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-18 13:52:03,218 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:03,219 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:03,219 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:03,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -1942139802, now seen corresponding path program 1 times
[2024-11-18 13:52:03,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:03,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060340495]
[2024-11-18 13:52:03,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:03,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:03,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:52:03,234 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [18742688]
[2024-11-18 13:52:03,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:03,234 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:03,234 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:03,236 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-18 13:52:03,237 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-18 13:52:03,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:03,274 INFO  L255         TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:03,275 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:03,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-18 13:52:03,335 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 13:52:03,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:03,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060340495]
[2024-11-18 13:52:03,335 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:52:03,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18742688]
[2024-11-18 13:52:03,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [18742688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:52:03,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:52:03,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-18 13:52:03,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905296194]
[2024-11-18 13:52:03,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:52:03,336 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-18 13:52:03,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:03,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-18 13:52:03,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-18 13:52:03,337 INFO  L87              Difference]: Start difference. First operand 71 states and 88 transitions. Second operand  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:03,446 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:03,446 INFO  L93              Difference]: Finished difference Result 108 states and 143 transitions.
[2024-11-18 13:52:03,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-18 13:52:03,447 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21
[2024-11-18 13:52:03,447 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:03,448 INFO  L225             Difference]: With dead ends: 108
[2024-11-18 13:52:03,448 INFO  L226             Difference]: Without dead ends: 96
[2024-11-18 13:52:03,449 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-11-18 13:52:03,449 INFO  L432           NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:03,450 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 13:52:03,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2024-11-18 13:52:03,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91.
[2024-11-18 13:52:03,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-18 13:52:03,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions.
[2024-11-18 13:52:03,472 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 21
[2024-11-18 13:52:03,473 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:03,473 INFO  L471      AbstractCegarLoop]: Abstraction has 91 states and 117 transitions.
[2024-11-18 13:52:03,473 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:03,473 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions.
[2024-11-18 13:52:03,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-18 13:52:03,474 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:03,474 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:03,491 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-18 13:52:03,678 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:03,679 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:03,679 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:03,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -1954557947, now seen corresponding path program 1 times
[2024-11-18 13:52:03,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:03,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154555081]
[2024-11-18 13:52:03,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:03,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:03,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:52:03,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229892231]
[2024-11-18 13:52:03,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:03,721 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:03,722 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:03,723 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-18 13:52:03,724 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-18 13:52:03,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:03,764 INFO  L255         TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:03,766 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:03,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-18 13:52:03,800 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 13:52:03,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:03,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154555081]
[2024-11-18 13:52:03,801 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:52:03,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229892231]
[2024-11-18 13:52:03,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229892231] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:52:03,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:52:03,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-18 13:52:03,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873071627]
[2024-11-18 13:52:03,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:52:03,802 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-18 13:52:03,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:03,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-18 13:52:03,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-18 13:52:03,803 INFO  L87              Difference]: Start difference. First operand 91 states and 117 transitions. Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-18 13:52:03,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:03,886 INFO  L93              Difference]: Finished difference Result 133 states and 172 transitions.
[2024-11-18 13:52:03,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-18 13:52:03,886 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32
[2024-11-18 13:52:03,887 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:03,888 INFO  L225             Difference]: With dead ends: 133
[2024-11-18 13:52:03,889 INFO  L226             Difference]: Without dead ends: 121
[2024-11-18 13:52:03,890 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-18 13:52:03,891 INFO  L432           NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:03,891 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:52:03,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2024-11-18 13:52:03,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105.
[2024-11-18 13:52:03,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 84 states have internal predecessors, (107), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-18 13:52:03,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions.
[2024-11-18 13:52:03,930 INFO  L78                 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 32
[2024-11-18 13:52:03,930 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:03,930 INFO  L471      AbstractCegarLoop]: Abstraction has 105 states and 135 transitions.
[2024-11-18 13:52:03,931 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-18 13:52:03,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions.
[2024-11-18 13:52:03,931 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-18 13:52:03,932 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:03,932 INFO  L215           NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:03,948 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-18 13:52:04,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:04,132 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:04,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:04,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 346264643, now seen corresponding path program 1 times
[2024-11-18 13:52:04,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:04,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880196747]
[2024-11-18 13:52:04,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:04,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:04,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-18 13:52:04,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177183621]
[2024-11-18 13:52:04,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-18 13:52:04,169 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:04,169 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:04,172 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-18 13:52:04,172 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-18 13:52:04,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-18 13:52:04,217 INFO  L255         TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:04,218 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:04,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-18 13:52:04,245 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-18 13:52:04,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:04,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880196747]
[2024-11-18 13:52:04,246 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-11-18 13:52:04,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177183621]
[2024-11-18 13:52:04,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177183621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-18 13:52:04,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-18 13:52:04,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-18 13:52:04,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259579509]
[2024-11-18 13:52:04,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-18 13:52:04,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-18 13:52:04,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:04,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-18 13:52:04,248 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-18 13:52:04,248 INFO  L87              Difference]: Start difference. First operand 105 states and 135 transitions. Second operand  has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:04,317 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:04,317 INFO  L93              Difference]: Finished difference Result 112 states and 141 transitions.
[2024-11-18 13:52:04,318 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-18 13:52:04,318 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32
[2024-11-18 13:52:04,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:04,319 INFO  L225             Difference]: With dead ends: 112
[2024-11-18 13:52:04,320 INFO  L226             Difference]: Without dead ends: 92
[2024-11-18 13:52:04,320 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-18 13:52:04,321 INFO  L432           NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:04,321 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-18 13:52:04,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2024-11-18 13:52:04,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58.
[2024-11-18 13:52:04,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2024-11-18 13:52:04,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions.
[2024-11-18 13:52:04,336 INFO  L78                 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 32
[2024-11-18 13:52:04,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:04,337 INFO  L471      AbstractCegarLoop]: Abstraction has 58 states and 71 transitions.
[2024-11-18 13:52:04,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-18 13:52:04,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions.
[2024-11-18 13:52:04,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-11-18 13:52:04,338 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:04,338 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:04,354 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-18 13:52:04,539 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:04,539 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:04,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:04,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 136508765, now seen corresponding path program 2 times
[2024-11-18 13:52:04,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:04,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271573773]
[2024-11-18 13:52:04,540 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:52:04,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:04,573 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:52:04,573 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:52:04,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-11-18 13:52:04,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-18 13:52:04,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271573773]
[2024-11-18 13:52:04,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271573773] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-18 13:52:04,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980466541]
[2024-11-18 13:52:04,796 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-18 13:52:04,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:04,797 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:04,800 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-18 13:52:04,801 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-18 13:52:04,859 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-18 13:52:04,860 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-18 13:52:04,861 INFO  L255         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-18 13:52:04,863 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-18 13:52:04,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-18 13:52:04,921 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-18 13:52:05,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-11-18 13:52:05,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980466541] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-18 13:52:05,032 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-18 13:52:05,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14
[2024-11-18 13:52:05,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936764686]
[2024-11-18 13:52:05,032 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-18 13:52:05,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-18 13:52:05,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-18 13:52:05,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-18 13:52:05,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2024-11-18 13:52:05,034 INFO  L87              Difference]: Start difference. First operand 58 states and 71 transitions. Second operand  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12)
[2024-11-18 13:52:05,209 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-18 13:52:05,209 INFO  L93              Difference]: Finished difference Result 132 states and 169 transitions.
[2024-11-18 13:52:05,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-11-18 13:52:05,210 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 46
[2024-11-18 13:52:05,210 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-18 13:52:05,211 INFO  L225             Difference]: With dead ends: 132
[2024-11-18 13:52:05,211 INFO  L226             Difference]: Without dead ends: 124
[2024-11-18 13:52:05,212 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506
[2024-11-18 13:52:05,213 INFO  L432           NwaCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-18 13:52:05,213 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 182 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-18 13:52:05,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2024-11-18 13:52:05,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124.
[2024-11-18 13:52:05,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-18 13:52:05,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions.
[2024-11-18 13:52:05,242 INFO  L78                 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 46
[2024-11-18 13:52:05,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-18 13:52:05,243 INFO  L471      AbstractCegarLoop]: Abstraction has 124 states and 155 transitions.
[2024-11-18 13:52:05,243 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12)
[2024-11-18 13:52:05,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions.
[2024-11-18 13:52:05,248 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2024-11-18 13:52:05,248 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-18 13:52:05,249 INFO  L215           NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:05,268 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-18 13:52:05,449 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-11-18 13:52:05,450 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-18 13:52:05,450 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-18 13:52:05,450 INFO  L85        PathProgramCache]: Analyzing trace with hash -1689445411, now seen corresponding path program 3 times
[2024-11-18 13:52:05,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-18 13:52:05,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280148236]
[2024-11-18 13:52:05,450 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-18 13:52:05,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-18 13:52:05,616 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-11-18 13:52:05,616 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unknown
[2024-11-18 13:52:05,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167604301]
[2024-11-18 13:52:05,619 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-18 13:52:05,619 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:05,619 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-18 13:52:05,621 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-18 13:52:05,622 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-18 13:52:06,071 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s)
[2024-11-18 13:52:06,071 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-18 13:52:06,071 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-18 13:52:06,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-18 13:52:06,152 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-18 13:52:06,153 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-18 13:52:06,154 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-18 13:52:06,163 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-18 13:52:06,356 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-18 13:52:06,358 INFO  L407         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-18 13:52:06,410 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-18 13:52:06,413 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:52:06 BoogieIcfgContainer
[2024-11-18 13:52:06,413 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-18 13:52:06,413 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-18 13:52:06,413 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-18 13:52:06,414 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-18 13:52:06,414 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:51:57" (3/4) ...
[2024-11-18 13:52:06,417 INFO  L136         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-18 13:52:06,499 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-18 13:52:06,499 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-18 13:52:06,499 INFO  L158              Benchmark]: Toolchain (without parser) took 9321.61ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 89.4MB in the beginning and 170.7MB in the end (delta: -81.3MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,500 INFO  L158              Benchmark]: CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory was 106.8MB in the beginning and 106.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 13:52:06,500 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 258.42ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 76.4MB in the end (delta: 13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,500 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.35ms. Allocated memory is still 144.7MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,500 INFO  L158              Benchmark]: Boogie Preprocessor took 43.48ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 73.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,501 INFO  L158              Benchmark]: RCFGBuilder took 296.49ms. Allocated memory is still 144.7MB. Free memory was 73.0MB in the beginning and 60.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,501 INFO  L158              Benchmark]: TraceAbstraction took 8598.63ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 60.0MB in the beginning and 175.9MB in the end (delta: -115.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-18 13:52:06,501 INFO  L158              Benchmark]: Witness Printer took 85.61ms. Allocated memory is still 234.9MB. Free memory was 175.9MB in the beginning and 170.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-18 13:52:06,502 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory was 106.8MB in the beginning and 106.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 258.42ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 76.4MB in the end (delta: 13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.35ms. Allocated memory is still 144.7MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 43.48ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 73.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 296.49ms. Allocated memory is still 144.7MB. Free memory was 73.0MB in the beginning and 60.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8598.63ms. Allocated memory was 144.7MB in the beginning and 234.9MB in the end (delta: 90.2MB). Free memory was 60.0MB in the beginning and 175.9MB in the end (delta: -115.9MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 85.61ms. Allocated memory is still 234.9MB. Free memory was 175.9MB in the beginning and 170.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 14]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L19]              int counter = 0;
       VAL         [counter=0]
[L21]              int x, y;
[L22]              long long a, b, p, q;
[L24]              x = __VERIFIER_nondet_int()
[L25]              y = __VERIFIER_nondet_int()
[L26]  CALL        assume_abort_if_not(y >= 1)
[L9]   COND FALSE  !(!cond)
       VAL         [counter=0]
[L26]  RET         assume_abort_if_not(y >= 1)
[L28]              a = x
[L29]              b = y
[L30]              p = 1
[L31]              q = 0
       VAL         [a=1024, b=1024, counter=0, p=1, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=1]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=1]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=1024, b=1024, counter=1, p=1, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=512, b=512, counter=1, p=4, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=2]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=2]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=512, b=512, counter=2, p=4, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=256, b=256, counter=2, p=16, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=3]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=3]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=256, b=256, counter=3, p=16, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=128, b=128, counter=3, p=64, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=4]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=4]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=128, b=128, counter=4, p=64, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=64, b=64, counter=4, p=256, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=5]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=5]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=64, b=64, counter=5, p=256, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=32, b=32, counter=5, p=1024, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=6]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=6]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=32, b=32, counter=6, p=1024, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=16, b=16, counter=6, p=4096, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=7]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=7]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=16, b=16, counter=7, p=4096, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=8, b=8, counter=7, p=16384, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=8]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=8]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=8, b=8, counter=8, p=16384, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=4, b=4, counter=8, p=65536, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=9]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=9]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=4, b=4, counter=9, p=65536, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=2, b=2, counter=9, p=262144, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024]
[L33]  COND TRUE   counter++<10
[L34]  CALL        __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [\old(cond)=1, counter=10]
[L12]  COND FALSE  !(!(cond))
       VAL         [\old(cond)=1, counter=10]
[L34]  RET         __VERIFIER_assert(q + a * b * p == (long long) x * y)
       VAL         [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024]
[L36]  COND FALSE  !(!(a != 0 && b != 0))
       VAL         [a=2, b=2, counter=10, p=262144, q=0, x=1024, y=1024]
[L39]  COND TRUE   a % 2 == 0 && b % 2 == 0
[L40]              a = a / 2
[L41]              b = b / 2
[L42]              p = 4 * p
       VAL         [a=1, b=1, counter=10, p=1048576, q=0, x=1024, y=1024]
[L33]  EXPR        counter++
       VAL         [a=1, b=1, counter=11, p=1048576, q=0, x=1024, y=1024]
[L33]  COND FALSE  !(counter++<10)
[L56]  CALL        __VERIFIER_assert(q == (long long) x * y)
       VAL         [\old(cond)=0, counter=11]
[L12]  COND TRUE   !(cond)
       VAL         [\old(cond)=0, counter=11]
[L14]              reach_error()
       VAL         [\old(cond)=0, counter=11]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 727 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 213 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=10, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 123 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 363 ConstructedInterpolants, 3 QuantifiedInterpolants, 1439 SizeOfPredicates, 20 NumberOfNonLiveVariables, 706 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 134/288 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
RESULT: Ultimate proved your program to be incorrect!
[2024-11-18 13:52:06,528 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
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE