./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_unwindbound20.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 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:18:11,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:18:11,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:18:11,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:18:11,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:18:11,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:18:11,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:18:11,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:18:11,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:18:11,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:18:11,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:18:11,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:18:11,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:18:11,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:18:11,759 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:18:11,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:18:11,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:18:11,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:18:11,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:18:11,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:18:11,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:18:11,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:18:11,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:18:11,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:18:11,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:18:11,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:18:11,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:18:11,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:18:11,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:18:11,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:18:11,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:18:11,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:18:11,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:18:11,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:18:11,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:18:11,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:18:11,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:18:11,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:18:11,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:18:11,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:18:11,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:18:11,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:18:11,768 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 -> 68bb6d7d6818d105c8d36601291f0fbd6a765091c35c37006c1280fceb3f620a [2024-11-08 14:18:12,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:18:12,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:18:12,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:18:12,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:18:12,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:18:12,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2024-11-08 14:18:13,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:18:13,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:18:13,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2024-11-08 14:18:13,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71904f5fb/1ba31c59e9834769a8f65e3313847ae0/FLAG072f070b6 [2024-11-08 14:18:13,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71904f5fb/1ba31c59e9834769a8f65e3313847ae0 [2024-11-08 14:18:13,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:18:13,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:18:13,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:18:13,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:18:13,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:18:13,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275bdae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13, skipping insertion in model container [2024-11-08 14:18:13,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:18:13,864 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_unwindbound20.c[597,610] [2024-11-08 14:18:13,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:18:13,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:18:13,916 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_unwindbound20.c[597,610] [2024-11-08 14:18:13,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:18:13,945 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:18:13,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13 WrapperNode [2024-11-08 14:18:13,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:18:13,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:18:13,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:18:13,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:18:13,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,985 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-11-08 14:18:13,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:18:13,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:18:13,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:18:13,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:18:13,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:13,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,010 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-08 14:18:14,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:18:14,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:18:14,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:18:14,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:18:14,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (1/1) ... [2024-11-08 14:18:14,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:18:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:14,061 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-08 14:18:14,066 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-08 14:18:14,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:18:14,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:18:14,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:18:14,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:18:14,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:18:14,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:18:14,178 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:18:14,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:18:14,332 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 14:18:14,332 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:18:14,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:18:14,347 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:18:14,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:14 BoogieIcfgContainer [2024-11-08 14:18:14,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:18:14,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:18:14,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:18:14,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:18:14,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:18:13" (1/3) ... [2024-11-08 14:18:14,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271aaa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:18:14, skipping insertion in model container [2024-11-08 14:18:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:18:13" (2/3) ... [2024-11-08 14:18:14,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271aaa9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:18:14, skipping insertion in model container [2024-11-08 14:18:14,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:14" (3/3) ... [2024-11-08 14:18:14,358 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2024-11-08 14:18:14,375 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:18:14,375 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:18:14,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:18:14,439 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;@4c1d66db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:18:14,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:18:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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-08 14:18:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:18:14,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:14,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:14,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2024-11-08 14:18:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311587611] [2024-11-08 14:18:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794424675] [2024-11-08 14:18:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:14,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:14,604 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-08 14:18:14,605 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-08 14:18:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:14,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:18:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:14,855 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-08 14:18:14,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:18:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311587611] [2024-11-08 14:18:14,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794424675] [2024-11-08 14:18:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794424675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:18:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135502493] [2024-11-08 14:18:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:14,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:18:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:18:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:18:14,885 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-08 14:18:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:15,017 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-08 14:18:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:18:15,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 8 [2024-11-08 14:18:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:15,027 INFO L225 Difference]: With dead ends: 52 [2024-11-08 14:18:15,027 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 14:18:15,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-08 14:18:15,033 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:15,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 14:18:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-11-08 14:18:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 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-08 14:18:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 14:18:15,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2024-11-08 14:18:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 14:18:15,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-08 14:18:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 14:18:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 14:18:15,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:15,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:15,086 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-08 14:18:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 14:18:15,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:15,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1226236780, now seen corresponding path program 1 times [2024-11-08 14:18:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866146524] [2024-11-08 14:18:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,369 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-08 14:18:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866146524] [2024-11-08 14:18:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866146524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:15,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:18:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97916526] [2024-11-08 14:18:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:15,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:18:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:18:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:18:15,373 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-08 14:18:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:15,390 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-08 14:18:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:18:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-08 14:18:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:15,395 INFO L225 Difference]: With dead ends: 31 [2024-11-08 14:18:15,395 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 14:18:15,396 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-08 14:18:15,397 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-08 14:18:15,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 14:18:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 14:18:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 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-08 14:18:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-08 14:18:15,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-11-08 14:18:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:15,404 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-08 14:18:15,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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-08 14:18:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-08 14:18:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 14:18:15,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:15,405 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:18:15,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:15,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1414665262, now seen corresponding path program 1 times [2024-11-08 14:18:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49901735] [2024-11-08 14:18:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:15,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339015074] [2024-11-08 14:18:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:15,450 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-08 14:18:15,455 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-08 14:18:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:15,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:18:15,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:15,640 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-08 14:18:15,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:18:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49901735] [2024-11-08 14:18:15,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339015074] [2024-11-08 14:18:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339015074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:18:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:18:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:18:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082212868] [2024-11-08 14:18:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:18:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:18:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:18:15,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:18:15,646 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 14:18:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:15,728 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-08 14:18:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:18:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-11-08 14:18:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:15,729 INFO L225 Difference]: With dead ends: 33 [2024-11-08 14:18:15,730 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 14:18:15,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-08 14:18:15,731 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:15,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 14:18:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-08 14:18:15,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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-08 14:18:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-08 14:18:15,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2024-11-08 14:18:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-08 14:18:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 14:18:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-08 14:18:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:18:15,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:15,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:15,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:18:15,942 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,SelfDestructingSolverStorable2 [2024-11-08 14:18:15,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2024-11-08 14:18:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691499274] [2024-11-08 14:18:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946625645] [2024-11-08 14:18:15,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:15,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:15,978 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-08 14:18:15,980 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-08 14:18:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 14:18:16,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:16,207 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-08 14:18:16,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:16,335 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-08 14:18:16,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691499274] [2024-11-08 14:18:16,336 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946625645] [2024-11-08 14:18:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946625645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:16,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:16,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-08 14:18:16,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691816443] [2024-11-08 14:18:16,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:18:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:18:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:18:16,339 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-08 14:18:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:16,540 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-08 14:18:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 14:18:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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 18 [2024-11-08 14:18:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:16,542 INFO L225 Difference]: With dead ends: 41 [2024-11-08 14:18:16,542 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 14:18:16,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 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-08 14:18:16,543 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 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-08 14:18:16,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 14:18:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2024-11-08 14:18:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-08 14:18:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-08 14:18:16,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2024-11-08 14:18:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:16,559 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-08 14:18:16,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-08 14:18:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-08 14:18:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 14:18:16,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:16,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:16,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:16,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:16,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 606185, now seen corresponding path program 1 times [2024-11-08 14:18:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919780246] [2024-11-08 14:18:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,882 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-08 14:18:16,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:16,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919780246] [2024-11-08 14:18:16,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919780246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:16,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995014167] [2024-11-08 14:18:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:16,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:16,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:16,889 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-08 14:18:16,891 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-08 14:18:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:16,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:18:16,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:17,060 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-08 14:18:17,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:17,113 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-08 14:18:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995014167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:17,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-08 14:18:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897214840] [2024-11-08 14:18:17,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:18:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:18:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:18:17,117 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 14:18:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:17,192 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-08 14:18:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:18:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-08 14:18:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:17,196 INFO L225 Difference]: With dead ends: 68 [2024-11-08 14:18:17,198 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 14:18:17,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:18:17,199 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:17,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 14:18:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-11-08 14:18:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-08 14:18:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-08 14:18:17,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 19 [2024-11-08 14:18:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:17,215 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-08 14:18:17,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 14:18:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 14:18:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 14:18:17,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:17,217 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:17,235 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-08 14:18:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:17,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1993750159, now seen corresponding path program 1 times [2024-11-08 14:18:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222864480] [2024-11-08 14:18:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:17,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414247109] [2024-11-08 14:18:17,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:17,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:17,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:17,470 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-08 14:18:17,472 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-08 14:18:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:17,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 14:18:17,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:17,694 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-08 14:18:17,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:17,852 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-08 14:18:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222864480] [2024-11-08 14:18:17,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414247109] [2024-11-08 14:18:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414247109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:17,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-08 14:18:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165007911] [2024-11-08 14:18:17,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:17,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:18:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:18:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:18:17,857 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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-08 14:18:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:18,129 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2024-11-08 14:18:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:18:18,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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 25 [2024-11-08 14:18:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:18,131 INFO L225 Difference]: With dead ends: 79 [2024-11-08 14:18:18,131 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 14:18:18,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:18:18,132 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:18,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:18:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 14:18:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-08 14:18:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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-08 14:18:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-11-08 14:18:18,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 25 [2024-11-08 14:18:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:18,151 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-11-08 14:18:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 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-08 14:18:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-11-08 14:18:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 14:18:18,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:18,153 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:18,169 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-08 14:18:18,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:18,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2024-11-08 14:18:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:18,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016780967] [2024-11-08 14:18:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:18,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34576984] [2024-11-08 14:18:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:18,391 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-08 14:18:18,393 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-08 14:18:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:18,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 14:18:18,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:18,813 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-08 14:18:18,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:25,985 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-08 14:18:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016780967] [2024-11-08 14:18:25,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:18:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34576984] [2024-11-08 14:18:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34576984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:25,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:18:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-08 14:18:25,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540532678] [2024-11-08 14:18:25,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 14:18:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 14:18:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:18:25,989 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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-08 14:18:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:28,697 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-08 14:18:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 14:18:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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 25 [2024-11-08 14:18:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:28,700 INFO L225 Difference]: With dead ends: 86 [2024-11-08 14:18:28,700 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 14:18:28,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 14:18:28,701 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:28,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 14:18:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 14:18:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-08 14:18:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 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-08 14:18:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-11-08 14:18:28,722 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 25 [2024-11-08 14:18:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:28,723 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-11-08 14:18:28,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 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-08 14:18:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-11-08 14:18:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 14:18:28,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:28,724 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:28,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 14:18:28,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:28,929 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:28,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 741920142, now seen corresponding path program 1 times [2024-11-08 14:18:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:28,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494189842] [2024-11-08 14:18:28,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494189842] [2024-11-08 14:18:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494189842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529350741] [2024-11-08 14:18:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:29,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:29,078 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-08 14:18:29,082 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-08 14:18:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 14:18:29,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:29,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 14:18:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529350741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:29,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:29,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-08 14:18:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355702295] [2024-11-08 14:18:29,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:18:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:18:29,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:18:29,389 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:29,536 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-11-08 14:18:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:18:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-11-08 14:18:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:29,537 INFO L225 Difference]: With dead ends: 88 [2024-11-08 14:18:29,537 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 14:18:29,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:18:29,538 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:29,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 14:18:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 14:18:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 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-08 14:18:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-08 14:18:29,554 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 35 [2024-11-08 14:18:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:29,554 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-08 14:18:29,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 14:18:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-08 14:18:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 14:18:29,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:29,556 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:29,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:29,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:29,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:29,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1464162251, now seen corresponding path program 2 times [2024-11-08 14:18:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671902811] [2024-11-08 14:18:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:29,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:29,929 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-08 14:18:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671902811] [2024-11-08 14:18:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671902811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666972849] [2024-11-08 14:18:29,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:18:29,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:29,932 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-08 14:18:29,933 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-08 14:18:29,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:18:29,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:29,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 14:18:29,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:30,148 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-08 14:18:30,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:30,357 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-08 14:18:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666972849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-08 14:18:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13572151] [2024-11-08 14:18:30,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 14:18:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 14:18:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:18:30,361 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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-08 14:18:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:30,710 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2024-11-08 14:18:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 14:18:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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 45 [2024-11-08 14:18:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:30,712 INFO L225 Difference]: With dead ends: 110 [2024-11-08 14:18:30,713 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 14:18:30,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2024-11-08 14:18:30,714 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:30,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 160 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 14:18:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-11-08 14:18:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 14:18:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-11-08 14:18:30,737 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 45 [2024-11-08 14:18:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-11-08 14:18:30,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 21 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-08 14:18:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-11-08 14:18:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 14:18:30,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:30,742 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:30,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:30,943 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,SelfDestructingSolverStorable8 [2024-11-08 14:18:30,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2024-11-08 14:18:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910328827] [2024-11-08 14:18:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:31,036 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-08 14:18:31,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910328827] [2024-11-08 14:18:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910328827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240867375] [2024-11-08 14:18:31,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:18:31,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:31,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:31,039 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-08 14:18:31,040 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-08 14:18:31,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:18:31,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:31,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 14:18:31,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:31,297 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-08 14:18:31,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:32,174 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-08 14:18:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240867375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:32,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 23 [2024-11-08 14:18:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325767477] [2024-11-08 14:18:32,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:32,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 14:18:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 14:18:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:18:32,177 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:18:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:33,637 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-11-08 14:18:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 14:18:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 45 [2024-11-08 14:18:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:33,638 INFO L225 Difference]: With dead ends: 134 [2024-11-08 14:18:33,639 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 14:18:33,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 14:18:33,640 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:33,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 14:18:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 14:18:33,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 62. [2024-11-08 14:18:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:18:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-11-08 14:18:33,667 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 45 [2024-11-08 14:18:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:33,667 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-11-08 14:18:33,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 9 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:18:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-11-08 14:18:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:18:33,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:33,668 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:33,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 14:18:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 14:18:33,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 2 times [2024-11-08 14:18:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795624832] [2024-11-08 14:18:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,019 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-08 14:18:34,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:34,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795624832] [2024-11-08 14:18:34,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795624832] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582080774] [2024-11-08 14:18:34,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:18:34,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:34,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:34,022 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-08 14:18:34,023 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-08 14:18:34,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:18:34,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:34,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:18:34,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:34,137 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-08 14:18:34,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:34,216 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-08 14:18:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582080774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:34,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:34,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-08 14:18:34,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497638554] [2024-11-08 14:18:34,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:18:34,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:34,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:18:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:18:34,218 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-08 14:18:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:34,346 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-11-08 14:18:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 14:18:34,347 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 49 [2024-11-08 14:18:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:34,349 INFO L225 Difference]: With dead ends: 128 [2024-11-08 14:18:34,349 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 14:18:34,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:18:34,350 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:34,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:18:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 14:18:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-08 14:18:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 98 states have internal predecessors, (110), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 14:18:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2024-11-08 14:18:34,372 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 49 [2024-11-08 14:18:34,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:34,372 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2024-11-08 14:18:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-08 14:18:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2024-11-08 14:18:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:18:34,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:34,374 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:34,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 14:18:34,575 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,SelfDestructingSolverStorable10 [2024-11-08 14:18:34,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 3 times [2024-11-08 14:18:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758851059] [2024-11-08 14:18:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:18:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 14:18:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 14:18:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:18:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 14:18:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 14:18:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:34,944 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-08 14:18:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758851059] [2024-11-08 14:18:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758851059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054725935] [2024-11-08 14:18:34,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 14:18:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:34,947 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-08 14:18:34,949 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-08 14:18:34,996 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 14:18:34,996 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:18:34,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 14:18:35,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:35,268 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-08 14:18:35,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:35,603 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-08 14:18:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054725935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:35,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:35,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 29 [2024-11-08 14:18:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661571429] [2024-11-08 14:18:35,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:35,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 14:18:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:35,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 14:18:35,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2024-11-08 14:18:35,605 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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-08 14:18:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:37,568 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2024-11-08 14:18:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-08 14:18:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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 109 [2024-11-08 14:18:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:37,571 INFO L225 Difference]: With dead ends: 239 [2024-11-08 14:18:37,573 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 14:18:37,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 219 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4788 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1964, Invalid=12556, Unknown=0, NotChecked=0, Total=14520 [2024-11-08 14:18:37,578 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 258 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:37,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 100 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:18:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 14:18:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2024-11-08 14:18:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 181 states have internal predecessors, (203), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 14:18:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2024-11-08 14:18:37,627 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 109 [2024-11-08 14:18:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:37,630 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2024-11-08 14:18:37,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.56) internal successors, (89), 28 states have internal predecessors, (89), 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-08 14:18:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2024-11-08 14:18:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 14:18:37,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:37,632 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:37,646 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-08 14:18:37,835 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,SelfDestructingSolverStorable11 [2024-11-08 14:18:37,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:37,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -640043763, now seen corresponding path program 1 times [2024-11-08 14:18:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524114897] [2024-11-08 14:18:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:18:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:18:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:18:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:18:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 14:18:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 14:18:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 14:18:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:18:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 14:18:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 14:18:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 14:18:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,276 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-08 14:18:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:18:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524114897] [2024-11-08 14:18:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524114897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:18:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785600235] [2024-11-08 14:18:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:38,279 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-08 14:18:38,281 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-08 14:18:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:18:38,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 14:18:38,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:18:38,497 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-08 14:18:38,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:18:38,772 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-08 14:18:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785600235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:18:38,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:18:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 24 [2024-11-08 14:18:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662179029] [2024-11-08 14:18:38,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:18:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 14:18:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:18:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 14:18:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-08 14:18:38,774 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-08 14:18:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:18:39,120 INFO L93 Difference]: Finished difference Result 415 states and 463 transitions. [2024-11-08 14:18:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-08 14:18:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) Word has length 119 [2024-11-08 14:18:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:18:39,123 INFO L225 Difference]: With dead ends: 415 [2024-11-08 14:18:39,123 INFO L226 Difference]: Without dead ends: 409 [2024-11-08 14:18:39,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=1140, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 14:18:39,125 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 83 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:18:39,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 187 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:18:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-08 14:18:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2024-11-08 14:18:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 325 states have (on average 1.123076923076923) internal successors, (365), 325 states have internal predecessors, (365), 41 states have call successors, (41), 40 states have call predecessors, (41), 39 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 14:18:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 446 transitions. [2024-11-08 14:18:39,184 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 446 transitions. Word has length 119 [2024-11-08 14:18:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:18:39,185 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 446 transitions. [2024-11-08 14:18:39,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 20 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2024-11-08 14:18:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 446 transitions. [2024-11-08 14:18:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 14:18:39,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:18:39,187 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:39,202 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-08 14:18:39,390 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,SelfDestructingSolverStorable12 [2024-11-08 14:18:39,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:18:39,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:18:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 18381746, now seen corresponding path program 2 times [2024-11-08 14:18:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:18:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980143658] [2024-11-08 14:18:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:18:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:18:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:18:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030794464] [2024-11-08 14:18:39,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:18:39,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:18:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:18:39,473 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-08 14:18:39,494 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-08 14:18:39,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:18:39,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 14:18:39,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 14:18:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:18:39,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 14:18:39,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 14:18:39,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:18:39,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 14:18:39,954 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,SelfDestructingSolverStorable13 [2024-11-08 14:18:39,956 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:18:40,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:18:40,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:18:40 BoogieIcfgContainer [2024-11-08 14:18:40,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:18:40,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:18:40,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:18:40,060 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:18:40,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:18:14" (3/4) ... [2024-11-08 14:18:40,061 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 14:18:40,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:18:40,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:18:40,171 INFO L158 Benchmark]: Toolchain (without parser) took 26509.38ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 101.2MB in the beginning and 63.2MB in the end (delta: 38.0MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,172 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:18:40,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.69ms. Allocated memory is still 159.4MB. Free memory was 100.8MB in the beginning and 88.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.80ms. Allocated memory is still 159.4MB. Free memory was 88.2MB in the beginning and 86.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,173 INFO L158 Benchmark]: Boogie Preprocessor took 36.48ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,173 INFO L158 Benchmark]: RCFGBuilder took 322.26ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 73.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,173 INFO L158 Benchmark]: TraceAbstraction took 25708.99ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 73.0MB in the beginning and 73.7MB in the end (delta: -701.1kB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,173 INFO L158 Benchmark]: Witness Printer took 110.81ms. Allocated memory is still 213.9MB. Free memory was 73.7MB in the beginning and 63.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 14:18:40,175 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.18ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.69ms. Allocated memory is still 159.4MB. Free memory was 100.8MB in the beginning and 88.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.80ms. Allocated memory is still 159.4MB. Free memory was 88.2MB in the beginning and 86.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.48ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.26ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 73.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25708.99ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 73.0MB in the beginning and 73.7MB in the end (delta: -701.1kB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Witness Printer took 110.81ms. Allocated memory is still 213.9MB. Free memory was 73.7MB in the beginning and 63.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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=80, Y=2, counter=0, v=-76, x=0, y=0] [L31] EXPR counter++ VAL [X=80, Y=2, counter=1, v=-76, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=1, v=-76, 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=80, Y=2, counter=1, v=-76, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=1, v=-76, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=1, v=-72, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=80, Y=2, counter=1, v=-72, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=80, Y=2, counter=2, v=-72, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=2, v=-72, x=1, 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=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=80, Y=2, counter=2, v=-72, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=2, v=-72, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=2, v=-68, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=80, Y=2, counter=2, v=-68, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=80, Y=2, counter=3, v=-68, x=2, xy=0, y=0, yx=2] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=3, v=-68, x=2, 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=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=80, Y=2, counter=3, v=-68, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=3, v=-68, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=3, v=-64, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=80, Y=2, counter=3, v=-64, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=80, Y=2, counter=4, v=-64, x=3, xy=0, y=0, yx=4] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=4, v=-64, x=3, 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=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=80, Y=2, counter=4, v=-64, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=4, v=-64, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=4, v=-60, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=80, Y=2, counter=4, v=-60, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=80, Y=2, counter=5, v=-60, x=4, xy=0, y=0, yx=6] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=5, v=-60, x=4, 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=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=80, Y=2, counter=5, v=-60, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=5, v=-60, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=5, v=-56, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=80, Y=2, counter=5, v=-56, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=80, Y=2, counter=6, v=-56, x=5, xy=0, y=0, yx=8] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=6, v=-56, x=5, 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=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=80, Y=2, counter=6, v=-56, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=6, v=-56, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=6, v=-52, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=80, Y=2, counter=6, v=-52, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=80, Y=2, counter=7, v=-52, x=6, xy=0, y=0, yx=10] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=7, v=-52, x=6, 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=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=80, Y=2, counter=7, v=-52, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=7, v=-52, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=7, v=-48, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=80, Y=2, counter=7, v=-48, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=80, Y=2, counter=8, v=-48, x=7, xy=0, y=0, yx=12] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=8, v=-48, x=7, 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=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=80, Y=2, counter=8, v=-48, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=8, v=-48, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=8, v=-44, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=80, Y=2, counter=8, v=-44, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=80, Y=2, counter=9, v=-44, x=8, xy=0, y=0, yx=14] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=9, v=-44, x=8, 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=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=80, Y=2, counter=9, v=-44, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=9, v=-44, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=9, v=-40, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=80, Y=2, counter=9, v=-40, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=80, Y=2, counter=10, v=-40, x=9, xy=0, y=0, yx=16] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=10, v=-40, x=9, 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=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=80, Y=2, counter=10, v=-40, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=10, v=-40, x=9, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=10, v=-36, x=9, xy=0, y=0, yx=18] [L45] x++ VAL [X=80, Y=2, counter=10, v=-36, x=10, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=80, Y=2, counter=11, v=-36, x=10, xy=0, y=0, yx=18] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=11, v=-36, x=10, 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=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=80, Y=2, counter=11, v=-36, x=10, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=11, v=-36, x=10, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=11, v=-32, x=10, xy=0, y=0, yx=20] [L45] x++ VAL [X=80, Y=2, counter=11, v=-32, x=11, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=80, Y=2, counter=12, v=-32, x=11, xy=0, y=0, yx=20] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=12, v=-32, x=11, 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=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=80, Y=2, counter=12, v=-32, x=11, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=12, v=-32, x=11, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=12, v=-28, x=11, xy=0, y=0, yx=22] [L45] x++ VAL [X=80, Y=2, counter=12, v=-28, x=12, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=80, Y=2, counter=13, v=-28, x=12, xy=0, y=0, yx=22] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=13, v=-28, x=12, 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=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=80, Y=2, counter=13, v=-28, x=12, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=13, v=-28, x=12, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=13, v=-24, x=12, xy=0, y=0, yx=24] [L45] x++ VAL [X=80, Y=2, counter=13, v=-24, x=13, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=80, Y=2, counter=14, v=-24, x=13, xy=0, y=0, yx=24] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=14, v=-24, x=13, 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=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=80, Y=2, counter=14, v=-24, x=13, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=14, v=-24, x=13, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=14, v=-20, x=13, xy=0, y=0, yx=26] [L45] x++ VAL [X=80, Y=2, counter=14, v=-20, x=14, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=80, Y=2, counter=15, v=-20, x=14, xy=0, y=0, yx=26] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=15, v=-20, x=14, 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=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=80, Y=2, counter=15, v=-20, x=14, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=15, v=-20, x=14, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=15, v=-16, x=14, xy=0, y=0, yx=28] [L45] x++ VAL [X=80, Y=2, counter=15, v=-16, x=15, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=80, Y=2, counter=16, v=-16, x=15, xy=0, y=0, yx=28] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=16, v=-16, x=15, 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=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=80, Y=2, counter=16, v=-16, x=15, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=16, v=-16, x=15, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=16, v=-12, x=15, xy=0, y=0, yx=30] [L45] x++ VAL [X=80, Y=2, counter=16, v=-12, x=16, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=80, Y=2, counter=17, v=-12, x=16, xy=0, y=0, yx=30] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=17, v=-12, x=16, 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=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=80, Y=2, counter=17, v=-12, x=16, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=17, v=-12, x=16, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=17, v=-8, x=16, xy=0, y=0, yx=32] [L45] x++ VAL [X=80, Y=2, counter=17, v=-8, x=17, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=80, Y=2, counter=18, v=-8, x=17, xy=0, y=0, yx=32] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=18, v=-8, x=17, 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=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=80, Y=2, counter=18, v=-8, x=17, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=18, v=-8, x=17, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=18, v=-4, x=17, xy=0, y=0, yx=34] [L45] x++ VAL [X=80, Y=2, counter=18, v=-4, x=18, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=80, Y=2, counter=19, v=-4, x=18, xy=0, y=0, yx=34] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=19, v=-4, x=18, 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=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=80, Y=2, counter=19, v=-4, x=18, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=19, v=-4, x=18, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=80, Y=2, counter=19, v=0, x=18, xy=0, y=0, yx=36] [L45] x++ VAL [X=80, Y=2, counter=19, v=0, x=19, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=80, Y=2, counter=20, v=0, x=19, xy=0, y=0, yx=36] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=80, Y=2, counter=20, v=0, x=19, 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=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=80, Y=2, counter=20, v=0, x=19, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=80, Y=2, counter=20, v=0, x=19, xy=0, y=0, yx=38] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=80, Y=2, counter=20, v=-156, x=19, xy=0, y=1, yx=38] [L45] x++ VAL [X=80, Y=2, counter=20, v=-156, x=20, xy=0, y=1, yx=38] [L31] EXPR counter++ VAL [X=80, Y=2, counter=21, v=-156, x=20, xy=0, y=1, yx=38] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=80, Y=2, counter=21, v=-156, xy=20, y=1, yx=40] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 14, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 1413 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1221 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1761 IncrementalHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 192 mSDtfsCounter, 1761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1291 GetRequests, 926 SyntacticMatches, 17 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5933 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=13, InterpolantAutomatonStates: 307, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1401 ConstructedInterpolants, 5 QuantifiedInterpolants, 5567 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1328 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 2066/4020 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-08 14:18:40,209 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