./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/bresenham-ll_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:56:56,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:56:56,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:56:56,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:56:56,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:56:56,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:56:56,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:56:56,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:56:56,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:56:56,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:56:56,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:56:56,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:56:56,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:56:56,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:56:56,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:56:56,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:56:56,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:56:56,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:56:56,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:56:56,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:56:56,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:56:56,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:56:56,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:56:56,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:56:56,329 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:56:56,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:56:56,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:56:56,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:56:56,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:56:56,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:56:56,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:56:56,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:56:56,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:56:56,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:56:56,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:56:56,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:56:56,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:56:56,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:56:56,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:56:56,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:56:56,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:56:56,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:56:56,333 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2024-11-16 06:56:56,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:56:56,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:56:56,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:56:56,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:56:56,595 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:56:56,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-16 06:56:58,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:56:58,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:56:58,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-16 06:56:58,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02cc33ac/ac8f34e3e0184599ae467a355617879d/FLAGc67c27cec [2024-11-16 06:56:58,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b02cc33ac/ac8f34e3e0184599ae467a355617879d [2024-11-16 06:56:58,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:56:58,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:56:58,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:56:58,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:56:58,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:56:58,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f0cab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58, skipping insertion in model container [2024-11-16 06:56:58,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:56:58,376 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/bresenham-ll_unwindbound50.c[597,610] [2024-11-16 06:56:58,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:56:58,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:56:58,408 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/bresenham-ll_unwindbound50.c[597,610] [2024-11-16 06:56:58,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:56:58,427 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:56:58,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58 WrapperNode [2024-11-16 06:56:58,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:56:58,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:56:58,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:56:58,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:56:58,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,453 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-16 06:56:58,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:56:58,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:56:58,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:56:58,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:56:58,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,471 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-16 06:56:58,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:56:58,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:56:58,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:56:58,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:56:58,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (1/1) ... [2024-11-16 06:56:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:56:58,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:56:58,517 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-16 06:56:58,526 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-16 06:56:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:56:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:56:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:56:58,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:56:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 06:56:58,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 06:56:58,624 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:56:58,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:56:58,818 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-16 06:56:58,819 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:56:58,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:56:58,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:56:58,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:58 BoogieIcfgContainer [2024-11-16 06:56:58,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:56:58,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:56:58,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:56:58,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:56:58,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:56:58" (1/3) ... [2024-11-16 06:56:58,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45952bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:58, skipping insertion in model container [2024-11-16 06:56:58,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:58" (2/3) ... [2024-11-16 06:56:58,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45952bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:58, skipping insertion in model container [2024-11-16 06:56:58,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:58" (3/3) ... [2024-11-16 06:56:58,839 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2024-11-16 06:56:58,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:56:58,853 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:56:58,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:56:58,916 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;@29ba7648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:56:58,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:56:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:56:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:56:58,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:56:58,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:56:58,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:56:58,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:56:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1647541884, now seen corresponding path program 1 times [2024-11-16 06:56:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:56:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902311698] [2024-11-16 06:56:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:56:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:56:59,057 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-16 06:56:59,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:56:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902311698] [2024-11-16 06:56:59,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902311698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:56:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:56:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:56:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638446718] [2024-11-16 06:56:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:56:59,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:56:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:56:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:56:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:56:59,082 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-16 06:56:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:56:59,094 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-16 06:56:59,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:56:59,096 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-16 06:56:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:56:59,100 INFO L225 Difference]: With dead ends: 40 [2024-11-16 06:56:59,101 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 06:56:59,103 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-16 06:56:59,105 INFO L432 NwaCegarLoop]: 24 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, 24 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-16 06:56:59,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:56:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 06:56:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-16 06:56:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:56:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-16 06:56:59,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2024-11-16 06:56:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:56:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-16 06:56:59,131 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-16 06:56:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-16 06:56:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 06:56:59,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:56:59,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:56:59,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:56:59,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:56:59,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:56:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2048060283, now seen corresponding path program 1 times [2024-11-16 06:56:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:56:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886202227] [2024-11-16 06:56:59,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:56:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:56:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210045559] [2024-11-16 06:56:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:56:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:56:59,156 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-16 06:56:59,159 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-16 06:56:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:56:59,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 06:56:59,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:56:59,384 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-16 06:56:59,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:56:59,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:56:59,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886202227] [2024-11-16 06:56:59,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:56:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210045559] [2024-11-16 06:56:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210045559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:56:59,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:56:59,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 06:56:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661272583] [2024-11-16 06:56:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:56:59,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:56:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:56:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:56:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:56:59,391 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-16 06:56:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:56:59,487 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-16 06:56:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:56:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-16 06:56:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:56:59,489 INFO L225 Difference]: With dead ends: 32 [2024-11-16 06:56:59,489 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:56:59,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:56:59,491 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:56:59,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:56:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:56:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-11-16 06:56:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:56:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-16 06:56:59,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2024-11-16 06:56:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:56:59,497 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-16 06:56:59,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-16 06:56:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-16 06:56:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-16 06:56:59,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:56:59,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:56:59,509 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-16 06:56:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:56:59,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:56:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:56:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 871498129, now seen corresponding path program 1 times [2024-11-16 06:56:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:56:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897312611] [2024-11-16 06:56:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:56:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:56:59,777 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-16 06:56:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:56:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897312611] [2024-11-16 06:56:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897312611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:56:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:56:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:56:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652395870] [2024-11-16 06:56:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:56:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:56:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:56:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:56:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:56:59,779 INFO L87 Difference]: Start difference. First operand 24 states and 28 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-16 06:56:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:56:59,789 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-16 06:56:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:56:59,789 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-16 06:56:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:56:59,790 INFO L225 Difference]: With dead ends: 33 [2024-11-16 06:56:59,790 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 06:56:59,791 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-16 06:56:59,792 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 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-16 06:56:59,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:56:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 06:56:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-16 06:56:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:56:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-16 06:56:59,796 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2024-11-16 06:56:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:56:59,796 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-16 06:56:59,796 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-16 06:56:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-16 06:56:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 06:56:59,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:56:59,797 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:56:59,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:56:59,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:56:59,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:56:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1495108965, now seen corresponding path program 1 times [2024-11-16 06:56:59,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:56:59,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506267638] [2024-11-16 06:56:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:56:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:56:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671191970] [2024-11-16 06:56:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:56:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:56:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:56:59,820 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-16 06:56:59,825 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-16 06:56:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:56:59,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 06:56:59,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:56:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:56:59,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:56:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:56:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506267638] [2024-11-16 06:56:59,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:56:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671191970] [2024-11-16 06:56:59,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671191970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:56:59,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:56:59,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 06:56:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254415669] [2024-11-16 06:56:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:56:59,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:56:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:56:59,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:56:59,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:56:59,962 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:00,020 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-16 06:57:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:57:00,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 06:57:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:00,021 INFO L225 Difference]: With dead ends: 35 [2024-11-16 06:57:00,022 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 06:57:00,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:57:00,023 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:00,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 06:57:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-16 06:57:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:57:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-16 06:57:00,027 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2024-11-16 06:57:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:00,027 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-16 06:57:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 06:57:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-16 06:57:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 06:57:00,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:00,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:00,044 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-16 06:57:00,232 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-16 06:57:00,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1720051596, now seen corresponding path program 1 times [2024-11-16 06:57:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526334767] [2024-11-16 06:57:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836223979] [2024-11-16 06:57:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:00,257 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-16 06:57:00,258 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-16 06:57:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:00,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 06:57:00,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:00,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:57:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526334767] [2024-11-16 06:57:00,497 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836223979] [2024-11-16 06:57:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836223979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:00,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:00,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-16 06:57:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760869884] [2024-11-16 06:57:00,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:00,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 06:57:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:00,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 06:57:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:57:00,500 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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-16 06:57:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:00,677 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-11-16 06:57:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 06:57:00,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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-16 06:57:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:00,678 INFO L225 Difference]: With dead ends: 43 [2024-11-16 06:57:00,678 INFO L226 Difference]: Without dead ends: 38 [2024-11-16 06:57:00,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-16 06:57:00,679 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:00,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 94 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-16 06:57:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2024-11-16 06:57:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:57:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-16 06:57:00,686 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2024-11-16 06:57:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-16 06:57:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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-16 06:57:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-16 06:57:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 06:57:00,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:00,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:00,705 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-16 06:57:00,891 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-16 06:57:00,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:00,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 24146872, now seen corresponding path program 1 times [2024-11-16 06:57:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464914019] [2024-11-16 06:57:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:00,979 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-16 06:57:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464914019] [2024-11-16 06:57:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464914019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412063227] [2024-11-16 06:57:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:00,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:00,982 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-16 06:57:00,983 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-16 06:57:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:01,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:57:01,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:01,051 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-16 06:57:01,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:01,091 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-16 06:57:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412063227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:01,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-16 06:57:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14786191] [2024-11-16 06:57:01,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:01,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 06:57:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 06:57:01,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 06:57:01,095 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-16 06:57:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:01,153 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-16 06:57:01,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:57:01,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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 20 [2024-11-16 06:57:01,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:01,155 INFO L225 Difference]: With dead ends: 72 [2024-11-16 06:57:01,155 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 06:57:01,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:57:01,156 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:01,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 06:57:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2024-11-16 06:57:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 06:57:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-16 06:57:01,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 20 [2024-11-16 06:57:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:01,173 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-16 06:57:01,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-16 06:57:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-16 06:57:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:57:01,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:01,174 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:01,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 06:57:01,374 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-16 06:57:01,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:01,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1935043458, now seen corresponding path program 1 times [2024-11-16 06:57:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:01,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600357460] [2024-11-16 06:57:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653281970] [2024-11-16 06:57:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:01,407 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-16 06:57:01,408 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-16 06:57:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:01,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 06:57:01,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:57:01,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:57:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600357460] [2024-11-16 06:57:01,670 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653281970] [2024-11-16 06:57:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653281970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-16 06:57:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574174853] [2024-11-16 06:57:01,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 06:57:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 06:57:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 06:57:01,672 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:57:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:01,858 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2024-11-16 06:57:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:57:01,859 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-11-16 06:57:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:01,860 INFO L225 Difference]: With dead ends: 81 [2024-11-16 06:57:01,860 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 06:57:01,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:01,861 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:01,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 06:57:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-16 06:57:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 06:57:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-11-16 06:57:01,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 26 [2024-11-16 06:57:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-11-16 06:57:01,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:57:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2024-11-16 06:57:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:57:01,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:01,878 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:01,890 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-16 06:57:02,078 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-16 06:57:02,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1424509281, now seen corresponding path program 1 times [2024-11-16 06:57:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:02,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548473506] [2024-11-16 06:57:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329054529] [2024-11-16 06:57:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:02,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:02,099 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-16 06:57:02,106 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-16 06:57:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:02,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 06:57:02,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:57:02,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:57:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548473506] [2024-11-16 06:57:02,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 06:57:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329054529] [2024-11-16 06:57:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329054529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:02,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:57:02,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-11-16 06:57:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39829473] [2024-11-16 06:57:02,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:02,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 06:57:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:02,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 06:57:02,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-11-16 06:57:02,995 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 06:57:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:03,575 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2024-11-16 06:57:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 06:57:03,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-16 06:57:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:03,576 INFO L225 Difference]: With dead ends: 91 [2024-11-16 06:57:03,576 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 06:57:03,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2024-11-16 06:57:03,577 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:03,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 06:57:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-16 06:57:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 06:57:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-16 06:57:03,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 26 [2024-11-16 06:57:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-16 06:57:03,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-16 06:57:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-16 06:57:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 06:57:03,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:03,592 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:03,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:03,796 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-16 06:57:03,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 372802095, now seen corresponding path program 1 times [2024-11-16 06:57:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386309670] [2024-11-16 06:57:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386309670] [2024-11-16 06:57:03,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386309670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295957966] [2024-11-16 06:57:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:03,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:03,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:03,999 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-16 06:57:04,000 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-16 06:57:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 06:57:04,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:04,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295957966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:04,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-16 06:57:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397607649] [2024-11-16 06:57:04,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 06:57:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 06:57:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:57:04,479 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 06:57:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:04,664 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2024-11-16 06:57:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 06:57:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 46 [2024-11-16 06:57:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:04,667 INFO L225 Difference]: With dead ends: 107 [2024-11-16 06:57:04,667 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 06:57:04,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-16 06:57:04,668 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:04,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 198 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 06:57:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2024-11-16 06:57:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 06:57:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-16 06:57:04,682 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 46 [2024-11-16 06:57:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-16 06:57:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 06:57:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-16 06:57:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 06:57:04,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:04,683 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:04,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 06:57:04,884 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-16 06:57:04,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2002884753, now seen corresponding path program 2 times [2024-11-16 06:57:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589186900] [2024-11-16 06:57:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:04,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589186900] [2024-11-16 06:57:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589186900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:04,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886480113] [2024-11-16 06:57:04,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:04,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:04,971 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-16 06:57:04,972 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-16 06:57:05,016 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:05,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:05,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:57:05,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 06:57:05,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:05,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886480113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:05,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-16 06:57:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102317746] [2024-11-16 06:57:05,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:05,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:57:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:57:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:57:05,099 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:57:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:05,159 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2024-11-16 06:57:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:57:05,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-16 06:57:05,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:05,160 INFO L225 Difference]: With dead ends: 122 [2024-11-16 06:57:05,160 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 06:57:05,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:57:05,161 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:05,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:57:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 06:57:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-16 06:57:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 78 states have internal predecessors, (91), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 06:57:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2024-11-16 06:57:05,175 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 46 [2024-11-16 06:57:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:05,175 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2024-11-16 06:57:05,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:57:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2024-11-16 06:57:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 06:57:05,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:05,177 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:05,195 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-16 06:57:05,380 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-16 06:57:05,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1971864946, now seen corresponding path program 3 times [2024-11-16 06:57:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:05,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238950217] [2024-11-16 06:57:05,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:05,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:05,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238950217] [2024-11-16 06:57:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238950217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688972070] [2024-11-16 06:57:05,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:57:05,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:05,640 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-16 06:57:05,641 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-16 06:57:05,783 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 06:57:05,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:05,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 06:57:05,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:06,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-16 06:57:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688972070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:13,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 31 [2024-11-16 06:57:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389256618] [2024-11-16 06:57:13,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:13,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-16 06:57:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-16 06:57:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=801, Unknown=2, NotChecked=0, Total=930 [2024-11-16 06:57:13,095 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 31 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 06:57:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:27,385 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2024-11-16 06:57:27,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-16 06:57:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 46 [2024-11-16 06:57:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:27,386 INFO L225 Difference]: With dead ends: 125 [2024-11-16 06:57:27,386 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 06:57:27,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=560, Invalid=2744, Unknown=2, NotChecked=0, Total=3306 [2024-11-16 06:57:27,388 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:27,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 233 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-16 06:57:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 06:57:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 75. [2024-11-16 06:57:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 06:57:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-16 06:57:27,410 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 46 [2024-11-16 06:57:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-16 06:57:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 11 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 06:57:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-16 06:57:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 06:57:27,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:27,415 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:27,422 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-16 06:57:27,618 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-16 06:57:27,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1331696211, now seen corresponding path program 2 times [2024-11-16 06:57:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788555422] [2024-11-16 06:57:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:27,754 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788555422] [2024-11-16 06:57:27,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788555422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:27,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777812039] [2024-11-16 06:57:27,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:27,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:27,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:27,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 06:57:27,812 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:27,813 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:27,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 06:57:27,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:27,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 06:57:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777812039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:27,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-11-16 06:57:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032388730] [2024-11-16 06:57:27,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:27,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 06:57:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 06:57:27,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-16 06:57:27,954 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 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-16 06:57:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:28,119 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2024-11-16 06:57:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 06:57:28,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 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 50 [2024-11-16 06:57:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:28,121 INFO L225 Difference]: With dead ends: 142 [2024-11-16 06:57:28,121 INFO L226 Difference]: Without dead ends: 135 [2024-11-16 06:57:28,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-16 06:57:28,122 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:28,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 144 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-16 06:57:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-16 06:57:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.1192660550458715) internal successors, (122), 109 states have internal predecessors, (122), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 06:57:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2024-11-16 06:57:28,149 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 50 [2024-11-16 06:57:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:28,149 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2024-11-16 06:57:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 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-16 06:57:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2024-11-16 06:57:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 06:57:28,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:28,151 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:28,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 06:57:28,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1625562793, now seen corresponding path program 3 times [2024-11-16 06:57:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284521898] [2024-11-16 06:57:28,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 06:57:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 06:57:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 06:57:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 06:57:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 06:57:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 06:57:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-16 06:57:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284521898] [2024-11-16 06:57:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284521898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783057572] [2024-11-16 06:57:28,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:57:28,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:28,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:28,726 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:28,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-16 06:57:28,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 06:57:28,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:28,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 06:57:28,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-16 06:57:29,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2024-11-16 06:57:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783057572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:29,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:29,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 30 [2024-11-16 06:57:29,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779115949] [2024-11-16 06:57:29,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:29,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 06:57:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 06:57:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2024-11-16 06:57:29,297 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 29 states have internal predecessors, (90), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 06:57:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:31,244 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2024-11-16 06:57:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-16 06:57:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 29 states have internal predecessors, (90), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 110 [2024-11-16 06:57:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:31,245 INFO L225 Difference]: With dead ends: 253 [2024-11-16 06:57:31,245 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 06:57:31,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4815 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1987, Invalid=12775, Unknown=0, NotChecked=0, Total=14762 [2024-11-16 06:57:31,249 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 249 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:31,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 120 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 06:57:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2024-11-16 06:57:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 192 states have (on average 1.1197916666666667) internal successors, (215), 192 states have internal predecessors, (215), 25 states have call successors, (25), 22 states have call predecessors, (25), 21 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 06:57:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 264 transitions. [2024-11-16 06:57:31,295 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 264 transitions. Word has length 110 [2024-11-16 06:57:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:31,296 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 264 transitions. [2024-11-16 06:57:31,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 29 states have internal predecessors, (90), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 06:57:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2024-11-16 06:57:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 06:57:31,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:31,297 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:31,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:31,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 06:57:31,502 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1573173987, now seen corresponding path program 1 times [2024-11-16 06:57:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352700540] [2024-11-16 06:57:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 06:57:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 06:57:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 06:57:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 06:57:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 06:57:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 06:57:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 06:57:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 06:57:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352700540] [2024-11-16 06:57:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352700540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084432437] [2024-11-16 06:57:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:31,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:31,886 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:31,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-16 06:57:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:31,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 06:57:31,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:32,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 22 proven. 352 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 06:57:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084432437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:32,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 30 [2024-11-16 06:57:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815018188] [2024-11-16 06:57:32,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:32,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 06:57:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 06:57:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2024-11-16 06:57:32,354 INFO L87 Difference]: Start difference. First operand 239 states and 264 transitions. Second operand has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 06:57:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:32,917 INFO L93 Difference]: Finished difference Result 509 states and 572 transitions. [2024-11-16 06:57:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-16 06:57:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 120 [2024-11-16 06:57:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:32,920 INFO L225 Difference]: With dead ends: 509 [2024-11-16 06:57:32,920 INFO L226 Difference]: Without dead ends: 502 [2024-11-16 06:57:32,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=966, Invalid=1686, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 06:57:32,922 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 129 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:32,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 238 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:57:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-16 06:57:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-16 06:57:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 400 states have (on average 1.1225) internal successors, (449), 400 states have internal predecessors, (449), 51 states have call successors, (51), 48 states have call predecessors, (51), 47 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 06:57:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 550 transitions. [2024-11-16 06:57:33,038 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 550 transitions. Word has length 120 [2024-11-16 06:57:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:33,038 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 550 transitions. [2024-11-16 06:57:33,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.433333333333334) internal successors, (163), 30 states have internal predecessors, (163), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 06:57:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 550 transitions. [2024-11-16 06:57:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-16 06:57:33,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:33,042 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:33,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-16 06:57:33,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-16 06:57:33,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:33,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1734444888, now seen corresponding path program 2 times [2024-11-16 06:57:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:33,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823389683] [2024-11-16 06:57:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 06:57:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 06:57:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 06:57:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 06:57:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 06:57:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 06:57:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 06:57:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 06:57:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 06:57:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 06:57:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 06:57:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 06:57:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 06:57:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 06:57:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 06:57:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 06:57:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-16 06:57:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-16 06:57:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 06:57:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 06:57:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-16 06:57:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-16 06:57:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-16 06:57:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-16 06:57:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:57:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 06:57:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:57:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823389683] [2024-11-16 06:57:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823389683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:57:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864136799] [2024-11-16 06:57:34,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:57:34,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:34,202 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-16 06:57:34,304 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:57:34,304 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:57:34,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 06:57:34,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:57:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:57:34,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:57:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 48 proven. 1704 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 06:57:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864136799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:57:35,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:57:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 56 [2024-11-16 06:57:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054178140] [2024-11-16 06:57:35,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:57:35,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-16 06:57:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:57:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-16 06:57:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2024-11-16 06:57:35,519 INFO L87 Difference]: Start difference. First operand 499 states and 550 transitions. Second operand has 56 states, 56 states have (on average 5.928571428571429) internal successors, (332), 56 states have internal predecessors, (332), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-16 06:57:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:57:37,070 INFO L93 Difference]: Finished difference Result 1029 states and 1157 transitions. [2024-11-16 06:57:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-16 06:57:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.928571428571429) internal successors, (332), 56 states have internal predecessors, (332), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 250 [2024-11-16 06:57:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:57:37,074 INFO L225 Difference]: With dead ends: 1029 [2024-11-16 06:57:37,074 INFO L226 Difference]: Without dead ends: 1022 [2024-11-16 06:57:37,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3956, Invalid=6756, Unknown=0, NotChecked=0, Total=10712 [2024-11-16 06:57:37,077 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 402 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:57:37,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 402 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 06:57:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-11-16 06:57:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1019. [2024-11-16 06:57:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 816 states have (on average 1.1237745098039216) internal successors, (917), 816 states have internal predecessors, (917), 103 states have call successors, (103), 100 states have call predecessors, (103), 99 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-16 06:57:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1122 transitions. [2024-11-16 06:57:37,288 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1122 transitions. Word has length 250 [2024-11-16 06:57:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:57:37,289 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1122 transitions. [2024-11-16 06:57:37,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.928571428571429) internal successors, (332), 56 states have internal predecessors, (332), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-16 06:57:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1122 transitions. [2024-11-16 06:57:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-11-16 06:57:37,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:57:37,295 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:37,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-16 06:57:37,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 06:57:37,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:57:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:57:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -306920562, now seen corresponding path program 3 times [2024-11-16 06:57:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:57:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104926222] [2024-11-16 06:57:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:57:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:57:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 06:57:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543500386] [2024-11-16 06:57:37,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 06:57:37,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:57:37,790 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:57:37,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-16 06:57:38,439 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-16 06:57:38,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 06:57:38,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:57:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:57:38,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:57:38,705 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:57:38,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:57:38,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-16 06:57:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:57:38,914 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:57:39,056 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:57:39,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:57:39 BoogieIcfgContainer [2024-11-16 06:57:39,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:57:39,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:57:39,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:57:39,059 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:57:39,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:58" (3/4) ... [2024-11-16 06:57:39,060 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:57:39,152 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:57:39,152 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:57:39,153 INFO L158 Benchmark]: Toolchain (without parser) took 40920.17ms. Allocated memory was 142.6MB in the beginning and 325.1MB in the end (delta: 182.5MB). Free memory was 73.5MB in the beginning and 148.9MB in the end (delta: -75.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,153 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:57:39,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.89ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 60.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.05ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,154 INFO L158 Benchmark]: Boogie Preprocessor took 22.95ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 57.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:57:39,154 INFO L158 Benchmark]: IcfgBuilder took 352.45ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 150.8MB in the end (delta: -93.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,154 INFO L158 Benchmark]: TraceAbstraction took 40226.12ms. Allocated memory was 184.5MB in the beginning and 325.1MB in the end (delta: 140.5MB). Free memory was 150.8MB in the beginning and 172.0MB in the end (delta: -21.2MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,154 INFO L158 Benchmark]: Witness Printer took 93.92ms. Allocated memory is still 325.1MB. Free memory was 172.0MB in the beginning and 148.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 06:57:39,155 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.17ms. Allocated memory is still 142.6MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.89ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 60.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.05ms. Allocated memory is still 142.6MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.95ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 57.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.45ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 57.4MB in the beginning and 150.8MB in the end (delta: -93.3MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 40226.12ms. Allocated memory was 184.5MB in the beginning and 325.1MB in the end (delta: 140.5MB). Free memory was 150.8MB in the beginning and 172.0MB in the end (delta: -21.2MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 93.92ms. Allocated memory is still 325.1MB. Free memory was 172.0MB in the beginning and 148.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=99, Y=1, counter=0, v=-97, x=0, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=1, v=-97, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=1, v=-97, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=1, v=-97, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=1, v=-97, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=1, v=-95, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=99, Y=1, counter=1, v=-95, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=2, v=-95, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=2, v=-95, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=2, v=-95, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=2, v=-95, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=2, v=-93, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=99, Y=1, counter=2, v=-93, x=2, xy=0, y=0, yx=1] [L31] EXPR counter++ VAL [X=99, Y=1, counter=3, v=-93, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=3, v=-93, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=3, v=-93, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=3, v=-93, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=3, v=-91, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=99, Y=1, counter=3, v=-91, x=3, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=99, Y=1, counter=4, v=-91, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=4, v=-91, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=4, v=-91, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=4, v=-91, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=4, v=-89, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=99, Y=1, counter=4, v=-89, x=4, xy=0, y=0, yx=3] [L31] EXPR counter++ VAL [X=99, Y=1, counter=5, v=-89, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=5, v=-89, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=5, v=-89, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=5, v=-89, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=5, v=-87, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=99, Y=1, counter=5, v=-87, x=5, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=99, Y=1, counter=6, v=-87, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=6, v=-87, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=6, v=-87, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=6, v=-87, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=6, v=-85, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=99, Y=1, counter=6, v=-85, x=6, xy=0, y=0, yx=5] [L31] EXPR counter++ VAL [X=99, Y=1, counter=7, v=-85, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=7, v=-85, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=7, v=-85, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=7, v=-85, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=7, v=-83, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=99, Y=1, counter=7, v=-83, x=7, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=99, Y=1, counter=8, v=-83, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=8, v=-83, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=8, v=-83, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=8, v=-83, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=8, v=-81, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=99, Y=1, counter=8, v=-81, x=8, xy=0, y=0, yx=7] [L31] EXPR counter++ VAL [X=99, Y=1, counter=9, v=-81, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=9, v=-81, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=9, v=-81, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=9, v=-81, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=9, v=-79, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=99, Y=1, counter=9, v=-79, x=9, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=99, Y=1, counter=10, v=-79, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=10, v=-79, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=10, v=-79, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=10, v=-79, x=9, xy=0, y=0, yx=9] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=10, v=-77, x=9, xy=0, y=0, yx=9] [L45] x++ VAL [X=99, Y=1, counter=10, v=-77, x=10, xy=0, y=0, yx=9] [L31] EXPR counter++ VAL [X=99, Y=1, counter=11, v=-77, x=10, xy=0, y=0, yx=9] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=11, v=-77, x=10, xy=0, y=0, yx=10] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=11, v=-77, x=10, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=11, v=-77, x=10, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=11, v=-75, x=10, xy=0, y=0, yx=10] [L45] x++ VAL [X=99, Y=1, counter=11, v=-75, x=11, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=99, Y=1, counter=12, v=-75, x=11, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=12, v=-75, x=11, xy=0, y=0, yx=11] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=12, v=-75, x=11, xy=0, y=0, yx=11] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=12, v=-75, x=11, xy=0, y=0, yx=11] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=12, v=-73, x=11, xy=0, y=0, yx=11] [L45] x++ VAL [X=99, Y=1, counter=12, v=-73, x=12, xy=0, y=0, yx=11] [L31] EXPR counter++ VAL [X=99, Y=1, counter=13, v=-73, x=12, xy=0, y=0, yx=11] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=13, v=-73, x=12, xy=0, y=0, yx=12] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=13, v=-73, x=12, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=13, v=-73, x=12, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=13, v=-71, x=12, xy=0, y=0, yx=12] [L45] x++ VAL [X=99, Y=1, counter=13, v=-71, x=13, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=99, Y=1, counter=14, v=-71, x=13, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=14, v=-71, x=13, xy=0, y=0, yx=13] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=14, v=-71, x=13, xy=0, y=0, yx=13] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=14, v=-71, x=13, xy=0, y=0, yx=13] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=14, v=-69, x=13, xy=0, y=0, yx=13] [L45] x++ VAL [X=99, Y=1, counter=14, v=-69, x=14, xy=0, y=0, yx=13] [L31] EXPR counter++ VAL [X=99, Y=1, counter=15, v=-69, x=14, xy=0, y=0, yx=13] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=15, v=-69, x=14, xy=0, y=0, yx=14] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=15, v=-69, x=14, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=15, v=-69, x=14, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=15, v=-67, x=14, xy=0, y=0, yx=14] [L45] x++ VAL [X=99, Y=1, counter=15, v=-67, x=15, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=99, Y=1, counter=16, v=-67, x=15, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=16, v=-67, x=15, xy=0, y=0, yx=15] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=16, v=-67, x=15, xy=0, y=0, yx=15] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=16, v=-67, x=15, xy=0, y=0, yx=15] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=16, v=-65, x=15, xy=0, y=0, yx=15] [L45] x++ VAL [X=99, Y=1, counter=16, v=-65, x=16, xy=0, y=0, yx=15] [L31] EXPR counter++ VAL [X=99, Y=1, counter=17, v=-65, x=16, xy=0, y=0, yx=15] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=17, v=-65, x=16, xy=0, y=0, yx=16] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=17, v=-65, x=16, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=17, v=-65, x=16, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=17, v=-63, x=16, xy=0, y=0, yx=16] [L45] x++ VAL [X=99, Y=1, counter=17, v=-63, x=17, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=99, Y=1, counter=18, v=-63, x=17, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=18, v=-63, x=17, xy=0, y=0, yx=17] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=18, v=-63, x=17, xy=0, y=0, yx=17] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=18, v=-63, x=17, xy=0, y=0, yx=17] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=18, v=-61, x=17, xy=0, y=0, yx=17] [L45] x++ VAL [X=99, Y=1, counter=18, v=-61, x=18, xy=0, y=0, yx=17] [L31] EXPR counter++ VAL [X=99, Y=1, counter=19, v=-61, x=18, xy=0, y=0, yx=17] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=19, v=-61, x=18, xy=0, y=0, yx=18] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=19, v=-61, x=18, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=19, v=-61, x=18, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=19, v=-59, x=18, xy=0, y=0, yx=18] [L45] x++ VAL [X=99, Y=1, counter=19, v=-59, x=19, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=99, Y=1, counter=20, v=-59, x=19, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=20, v=-59, x=19, xy=0, y=0, yx=19] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=20, v=-59, x=19, xy=0, y=0, yx=19] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=20, v=-59, x=19, xy=0, y=0, yx=19] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=20, v=-57, x=19, xy=0, y=0, yx=19] [L45] x++ VAL [X=99, Y=1, counter=20, v=-57, x=20, xy=0, y=0, yx=19] [L31] EXPR counter++ VAL [X=99, Y=1, counter=21, v=-57, x=20, xy=0, y=0, yx=19] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=21, v=-57, x=20, xy=0, y=0, yx=20] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=21, v=-57, x=20, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=21, v=-57, x=20, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=21, v=-55, x=20, xy=0, y=0, yx=20] [L45] x++ VAL [X=99, Y=1, counter=21, v=-55, x=21, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=99, Y=1, counter=22, v=-55, x=21, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=22, v=-55, x=21, xy=0, y=0, yx=21] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=22, v=-55, x=21, xy=0, y=0, yx=21] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=22, v=-55, x=21, xy=0, y=0, yx=21] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=22, v=-53, x=21, xy=0, y=0, yx=21] [L45] x++ VAL [X=99, Y=1, counter=22, v=-53, x=22, xy=0, y=0, yx=21] [L31] EXPR counter++ VAL [X=99, Y=1, counter=23, v=-53, x=22, xy=0, y=0, yx=21] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=23, v=-53, x=22, xy=0, y=0, yx=22] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=23, v=-53, x=22, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=23, v=-53, x=22, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=23, v=-51, x=22, xy=0, y=0, yx=22] [L45] x++ VAL [X=99, Y=1, counter=23, v=-51, x=23, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=99, Y=1, counter=24, v=-51, x=23, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=24, v=-51, x=23, xy=0, y=0, yx=23] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=24, v=-51, x=23, xy=0, y=0, yx=23] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=24, v=-51, x=23, xy=0, y=0, yx=23] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=24, v=-49, x=23, xy=0, y=0, yx=23] [L45] x++ VAL [X=99, Y=1, counter=24, v=-49, x=24, xy=0, y=0, yx=23] [L31] EXPR counter++ VAL [X=99, Y=1, counter=25, v=-49, x=24, xy=0, y=0, yx=23] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=25, v=-49, x=24, xy=0, y=0, yx=24] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=25, v=-49, x=24, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=25, v=-49, x=24, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=25, v=-47, x=24, xy=0, y=0, yx=24] [L45] x++ VAL [X=99, Y=1, counter=25, v=-47, x=25, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=99, Y=1, counter=26, v=-47, x=25, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=26, v=-47, x=25, xy=0, y=0, yx=25] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=26, v=-47, x=25, xy=0, y=0, yx=25] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=26, v=-47, x=25, xy=0, y=0, yx=25] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=26, v=-45, x=25, xy=0, y=0, yx=25] [L45] x++ VAL [X=99, Y=1, counter=26, v=-45, x=26, xy=0, y=0, yx=25] [L31] EXPR counter++ VAL [X=99, Y=1, counter=27, v=-45, x=26, xy=0, y=0, yx=25] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=27, v=-45, x=26, xy=0, y=0, yx=26] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=27, v=-45, x=26, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=27, v=-45, x=26, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=27, v=-43, x=26, xy=0, y=0, yx=26] [L45] x++ VAL [X=99, Y=1, counter=27, v=-43, x=27, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=99, Y=1, counter=28, v=-43, x=27, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=28, v=-43, x=27, xy=0, y=0, yx=27] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=28, v=-43, x=27, xy=0, y=0, yx=27] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=28, v=-43, x=27, xy=0, y=0, yx=27] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=28, v=-41, x=27, xy=0, y=0, yx=27] [L45] x++ VAL [X=99, Y=1, counter=28, v=-41, x=28, xy=0, y=0, yx=27] [L31] EXPR counter++ VAL [X=99, Y=1, counter=29, v=-41, x=28, xy=0, y=0, yx=27] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=29, v=-41, x=28, xy=0, y=0, yx=28] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=29, v=-41, x=28, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=29, v=-41, x=28, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=29, v=-39, x=28, xy=0, y=0, yx=28] [L45] x++ VAL [X=99, Y=1, counter=29, v=-39, x=29, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=99, Y=1, counter=30, v=-39, x=29, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=30, v=-39, x=29, xy=0, y=0, yx=29] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=30, v=-39, x=29, xy=0, y=0, yx=29] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=30, v=-39, x=29, xy=0, y=0, yx=29] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=30, v=-37, x=29, xy=0, y=0, yx=29] [L45] x++ VAL [X=99, Y=1, counter=30, v=-37, x=30, xy=0, y=0, yx=29] [L31] EXPR counter++ VAL [X=99, Y=1, counter=31, v=-37, x=30, xy=0, y=0, yx=29] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=31, v=-37, x=30, xy=0, y=0, yx=30] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=31, v=-37, x=30, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=31, v=-37, x=30, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=31, v=-35, x=30, xy=0, y=0, yx=30] [L45] x++ VAL [X=99, Y=1, counter=31, v=-35, x=31, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=99, Y=1, counter=32, v=-35, x=31, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=32, v=-35, x=31, xy=0, y=0, yx=31] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=32, v=-35, x=31, xy=0, y=0, yx=31] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=32, v=-35, x=31, xy=0, y=0, yx=31] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=32, v=-33, x=31, xy=0, y=0, yx=31] [L45] x++ VAL [X=99, Y=1, counter=32, v=-33, x=32, xy=0, y=0, yx=31] [L31] EXPR counter++ VAL [X=99, Y=1, counter=33, v=-33, x=32, xy=0, y=0, yx=31] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=33, v=-33, x=32, xy=0, y=0, yx=32] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=33, v=-33, x=32, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=33, v=-33, x=32, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=33, v=-31, x=32, xy=0, y=0, yx=32] [L45] x++ VAL [X=99, Y=1, counter=33, v=-31, x=33, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=99, Y=1, counter=34, v=-31, x=33, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=34, v=-31, x=33, xy=0, y=0, yx=33] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=34, v=-31, x=33, xy=0, y=0, yx=33] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=34, v=-31, x=33, xy=0, y=0, yx=33] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=34, v=-29, x=33, xy=0, y=0, yx=33] [L45] x++ VAL [X=99, Y=1, counter=34, v=-29, x=34, xy=0, y=0, yx=33] [L31] EXPR counter++ VAL [X=99, Y=1, counter=35, v=-29, x=34, xy=0, y=0, yx=33] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=35, v=-29, x=34, xy=0, y=0, yx=34] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=35, v=-29, x=34, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=35, v=-29, x=34, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=35, v=-27, x=34, xy=0, y=0, yx=34] [L45] x++ VAL [X=99, Y=1, counter=35, v=-27, x=35, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=99, Y=1, counter=36, v=-27, x=35, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=36, v=-27, x=35, xy=0, y=0, yx=35] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=36, v=-27, x=35, xy=0, y=0, yx=35] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=36, v=-27, x=35, xy=0, y=0, yx=35] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=36, v=-25, x=35, xy=0, y=0, yx=35] [L45] x++ VAL [X=99, Y=1, counter=36, v=-25, x=36, xy=0, y=0, yx=35] [L31] EXPR counter++ VAL [X=99, Y=1, counter=37, v=-25, x=36, xy=0, y=0, yx=35] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=37, v=-25, x=36, xy=0, y=0, yx=36] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=37, v=-25, x=36, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=37, v=-25, x=36, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=37, v=-23, x=36, xy=0, y=0, yx=36] [L45] x++ VAL [X=99, Y=1, counter=37, v=-23, x=37, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=99, Y=1, counter=38, v=-23, x=37, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=38, v=-23, x=37, xy=0, y=0, yx=37] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=38, v=-23, x=37, xy=0, y=0, yx=37] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=38, v=-23, x=37, xy=0, y=0, yx=37] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=38, v=-21, x=37, xy=0, y=0, yx=37] [L45] x++ VAL [X=99, Y=1, counter=38, v=-21, x=38, xy=0, y=0, yx=37] [L31] EXPR counter++ VAL [X=99, Y=1, counter=39, v=-21, x=38, xy=0, y=0, yx=37] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=39, v=-21, x=38, xy=0, y=0, yx=38] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=39, v=-21, x=38, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=39, v=-21, x=38, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=39, v=-19, x=38, xy=0, y=0, yx=38] [L45] x++ VAL [X=99, Y=1, counter=39, v=-19, x=39, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=99, Y=1, counter=40, v=-19, x=39, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=40, v=-19, x=39, xy=0, y=0, yx=39] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=40, v=-19, x=39, xy=0, y=0, yx=39] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=40, v=-19, x=39, xy=0, y=0, yx=39] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=40, v=-17, x=39, xy=0, y=0, yx=39] [L45] x++ VAL [X=99, Y=1, counter=40, v=-17, x=40, xy=0, y=0, yx=39] [L31] EXPR counter++ VAL [X=99, Y=1, counter=41, v=-17, x=40, xy=0, y=0, yx=39] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=41, v=-17, x=40, xy=0, y=0, yx=40] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=41, v=-17, x=40, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=41, v=-17, x=40, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=41, v=-15, x=40, xy=0, y=0, yx=40] [L45] x++ VAL [X=99, Y=1, counter=41, v=-15, x=41, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=99, Y=1, counter=42, v=-15, x=41, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=42, v=-15, x=41, xy=0, y=0, yx=41] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=42, v=-15, x=41, xy=0, y=0, yx=41] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=42, v=-15, x=41, xy=0, y=0, yx=41] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=42, v=-13, x=41, xy=0, y=0, yx=41] [L45] x++ VAL [X=99, Y=1, counter=42, v=-13, x=42, xy=0, y=0, yx=41] [L31] EXPR counter++ VAL [X=99, Y=1, counter=43, v=-13, x=42, xy=0, y=0, yx=41] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=43, v=-13, x=42, xy=0, y=0, yx=42] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=43, v=-13, x=42, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=43, v=-13, x=42, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=43, v=-11, x=42, xy=0, y=0, yx=42] [L45] x++ VAL [X=99, Y=1, counter=43, v=-11, x=43, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=99, Y=1, counter=44, v=-11, x=43, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=44, v=-11, x=43, xy=0, y=0, yx=43] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=44, v=-11, x=43, xy=0, y=0, yx=43] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=44, v=-11, x=43, xy=0, y=0, yx=43] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=44, v=-9, x=43, xy=0, y=0, yx=43] [L45] x++ VAL [X=99, Y=1, counter=44, v=-9, x=44, xy=0, y=0, yx=43] [L31] EXPR counter++ VAL [X=99, Y=1, counter=45, v=-9, x=44, xy=0, y=0, yx=43] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=45, v=-9, x=44, xy=0, y=0, yx=44] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=45, v=-9, x=44, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=45, v=-9, x=44, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=45, v=-7, x=44, xy=0, y=0, yx=44] [L45] x++ VAL [X=99, Y=1, counter=45, v=-7, x=45, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=99, Y=1, counter=46, v=-7, x=45, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=46, v=-7, x=45, xy=0, y=0, yx=45] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=46, v=-7, x=45, xy=0, y=0, yx=45] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=46, v=-7, x=45, xy=0, y=0, yx=45] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=46, v=-5, x=45, xy=0, y=0, yx=45] [L45] x++ VAL [X=99, Y=1, counter=46, v=-5, x=46, xy=0, y=0, yx=45] [L31] EXPR counter++ VAL [X=99, Y=1, counter=47, v=-5, x=46, xy=0, y=0, yx=45] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=47, v=-5, x=46, xy=0, y=0, yx=46] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=47, v=-5, x=46, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=47, v=-5, x=46, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=47, v=-3, x=46, xy=0, y=0, yx=46] [L45] x++ VAL [X=99, Y=1, counter=47, v=-3, x=47, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=99, Y=1, counter=48, v=-3, x=47, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=48, v=-3, x=47, xy=0, y=0, yx=47] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=48, v=-3, x=47, xy=0, y=0, yx=47] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=48, v=-3, x=47, xy=0, y=0, yx=47] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=48, v=-1, x=47, xy=0, y=0, yx=47] [L45] x++ VAL [X=99, Y=1, counter=48, v=-1, x=48, xy=0, y=0, yx=47] [L31] EXPR counter++ VAL [X=99, Y=1, counter=49, v=-1, x=48, xy=0, y=0, yx=47] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=49, v=-1, x=48, xy=0, y=0, yx=48] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=49, v=-1, x=48, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=49, v=-1, x=48, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=49, v=1, x=48, xy=0, y=0, yx=48] [L45] x++ VAL [X=99, Y=1, counter=49, v=1, x=49, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=99, Y=1, counter=50, v=1, x=49, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=50, v=1, x=49, xy=0, y=0, yx=49] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=99, Y=1, counter=50, v=1, x=49, xy=0, y=0, yx=49] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=50, v=1, x=49, xy=0, y=0, yx=49] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=99, Y=1, counter=50, v=-195, x=49, xy=0, y=1, yx=49] [L45] x++ VAL [X=99, Y=1, counter=50, v=-195, x=50, xy=0, y=1, yx=49] [L31] EXPR counter++ VAL [X=99, Y=1, counter=51, v=-195, x=50, xy=0, y=1, yx=49] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=99, Y=1, counter=51, v=-195, xy=50, y=1, yx=50] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.0s, OverallIterations: 16, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 999 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 996 mSDsluCounter, 2020 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1780 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1963 IncrementalHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 240 mSDtfsCounter, 1963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1968 GetRequests, 1499 SyntacticMatches, 13 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8027 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1019occurred in iteration=15, InterpolantAutomatonStates: 418, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 99 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 2607 NumberOfCodeBlocks, 2497 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 2216 ConstructedInterpolants, 6 QuantifiedInterpolants, 7941 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 4491/12678 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-16 06:57:39,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE