./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.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 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:28:19,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:28:19,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:28:19,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:28:19,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:28:19,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:28:19,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:28:19,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:28:19,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:28:19,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:28:19,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:28:19,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:28:19,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:28:19,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:28:19,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:28:19,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:28:19,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:28:19,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:28:19,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:28:19,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:28:19,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:28:19,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:28:19,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:28:19,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:28:19,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:28:19,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:28:19,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:28:19,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:28:19,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:28:19,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:28:19,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:28:19,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:28:19,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:28:19,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:28:19,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:28:19,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:28:19,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:28:19,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:28:19,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:28:19,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:28:19,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:28:19,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:28:19,547 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 -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2024-11-09 22:28:19,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:28:19,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:28:19,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:28:19,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:28:19,814 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:28:19,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2024-11-09 22:28:21,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:28:21,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:28:21,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2024-11-09 22:28:21,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce233c1aa/9ead4c1045154a90bb2c5ab691500e5f/FLAGdf891f736 [2024-11-09 22:28:21,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce233c1aa/9ead4c1045154a90bb2c5ab691500e5f [2024-11-09 22:28:21,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:28:21,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:28:21,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:28:21,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:28:21,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:28:21,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:21" (1/1) ... [2024-11-09 22:28:21,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aef8689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:21, skipping insertion in model container [2024-11-09 22:28:21,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:21" (1/1) ... [2024-11-09 22:28:21,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:28:21,927 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/cohencu-ll_unwindbound1.c[588,601] [2024-11-09 22:28:21,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:28:21,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:28:21,980 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/cohencu-ll_unwindbound1.c[588,601] [2024-11-09 22:28:22,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:28:22,018 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:28:22,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22 WrapperNode [2024-11-09 22:28:22,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:28:22,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:28:22,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:28:22,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:28:22,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,047 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-11-09 22:28:22,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:28:22,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:28:22,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:28:22,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:28:22,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,077 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-09 22:28:22,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:28:22,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:28:22,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:28:22,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:28:22,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (1/1) ... [2024-11-09 22:28:22,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:28:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:22,121 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-09 22:28:22,127 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-09 22:28:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:28:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:28:22,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:28:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:28:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:28:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:28:22,235 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:28:22,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:28:22,382 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-09 22:28:22,385 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:28:22,398 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:28:22,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:28:22,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:22 BoogieIcfgContainer [2024-11-09 22:28:22,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:28:22,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:28:22,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:28:22,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:28:22,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:28:21" (1/3) ... [2024-11-09 22:28:22,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dab426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:22, skipping insertion in model container [2024-11-09 22:28:22,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:22" (2/3) ... [2024-11-09 22:28:22,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dab426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:22, skipping insertion in model container [2024-11-09 22:28:22,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:22" (3/3) ... [2024-11-09 22:28:22,408 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2024-11-09 22:28:22,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:28:22,420 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:28:22,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:28:22,470 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;@18c527f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:28:22,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:28:22,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:28:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 22:28:22,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:22,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:22,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1686356366, now seen corresponding path program 1 times [2024-11-09 22:28:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597850072] [2024-11-09 22:28:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:22,618 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-09 22:28:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597850072] [2024-11-09 22:28:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597850072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:22,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:28:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316712577] [2024-11-09 22:28:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:22,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:28:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:28:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:28:22,645 INFO L87 Difference]: Start difference. First operand has 27 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-09 22:28:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:22,668 INFO L93 Difference]: Finished difference Result 52 states and 89 transitions. [2024-11-09 22:28:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:28:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-09 22:28:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:22,675 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:28:22,675 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 22:28:22,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:28:22,681 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:28:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 22:28:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 22:28:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 22:28:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2024-11-09 22:28:22,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 8 [2024-11-09 22:28:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:22,716 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2024-11-09 22:28:22,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-09 22:28:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2024-11-09 22:28:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:28:22,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:22,717 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:22,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:28:22,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:22,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1994067049, now seen corresponding path program 1 times [2024-11-09 22:28:22,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977538481] [2024-11-09 22:28:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:22,843 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-09 22:28:22,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:22,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977538481] [2024-11-09 22:28:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977538481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:28:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502741634] [2024-11-09 22:28:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:22,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:28:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:28:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:28:22,847 INFO L87 Difference]: Start difference. First operand 23 states and 34 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-09 22:28:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:22,866 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2024-11-09 22:28:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:28:22,867 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-09 22:28:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:22,868 INFO L225 Difference]: With dead ends: 38 [2024-11-09 22:28:22,868 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 22:28:22,868 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-09 22:28:22,869 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 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-09 22:28:22,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:28:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 22:28:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 22:28:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 22:28:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-11-09 22:28:22,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 9 [2024-11-09 22:28:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-11-09 22:28:22,883 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-09 22:28:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2024-11-09 22:28:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:28:22,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:22,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:28:22,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2031931410, now seen corresponding path program 1 times [2024-11-09 22:28:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418776297] [2024-11-09 22:28:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:23,167 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-09 22:28:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:23,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418776297] [2024-11-09 22:28:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418776297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764543308] [2024-11-09 22:28:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:23,169 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-09 22:28:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:23,310 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-09 22:28:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-09 22:28:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:23,312 INFO L225 Difference]: With dead ends: 32 [2024-11-09 22:28:23,312 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:28:23,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:28:23,314 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:23,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:28:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:28:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:28:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 22:28:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-09 22:28:23,327 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 9 [2024-11-09 22:28:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:23,327 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-09 22:28:23,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-09 22:28:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-09 22:28:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 22:28:23,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:23,328 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:23,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:28:23,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:23,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1400374437, now seen corresponding path program 1 times [2024-11-09 22:28:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139853477] [2024-11-09 22:28:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927430273] [2024-11-09 22:28:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:23,356 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-09 22:28:23,358 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-09 22:28:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:23,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:28:23,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:23,522 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-09 22:28:23,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139853477] [2024-11-09 22:28:23,523 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927430273] [2024-11-09 22:28:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927430273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775308445] [2024-11-09 22:28:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:23,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:23,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:23,526 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-09 22:28:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:23,623 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2024-11-09 22:28:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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 14 [2024-11-09 22:28:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:23,625 INFO L225 Difference]: With dead ends: 48 [2024-11-09 22:28:23,625 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 22:28:23,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:28:23,627 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:23,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:28:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 22:28:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2024-11-09 22:28:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 22:28:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-09 22:28:23,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 14 [2024-11-09 22:28:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:23,643 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-09 22:28:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 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-09 22:28:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-09 22:28:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:28:23,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:23,644 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:23,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:28:23,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:23,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:23,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1833948082, now seen corresponding path program 1 times [2024-11-09 22:28:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:23,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341358666] [2024-11-09 22:28:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016737812] [2024-11-09 22:28:23,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:23,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:28:23,877 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-09 22:28:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:23,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:28:23,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:28:23,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341358666] [2024-11-09 22:28:23,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016737812] [2024-11-09 22:28:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016737812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114460742] [2024-11-09 22:28:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:23,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:23,981 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:28:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:24,090 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-11-09 22:28:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 22:28:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:24,092 INFO L225 Difference]: With dead ends: 52 [2024-11-09 22:28:24,092 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:28:24,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:28:24,093 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:24,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:28:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:28:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-09 22:28:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 22:28:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-11-09 22:28:24,112 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 19 [2024-11-09 22:28:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-11-09 22:28:24,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:28:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-11-09 22:28:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 22:28:24,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:24,115 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:24,128 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-09 22:28:24,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:24,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 799704197, now seen corresponding path program 1 times [2024-11-09 22:28:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824965006] [2024-11-09 22:28:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382486269] [2024-11-09 22:28:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:24,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:24,336 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-09 22:28:24,338 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-09 22:28:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:28:24,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:28:24,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:28:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:28:24,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:28:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:28:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824965006] [2024-11-09 22:28:24,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:28:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382486269] [2024-11-09 22:28:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382486269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:28:24,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:28:24,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:28:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208396867] [2024-11-09 22:28:24,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:28:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:28:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:28:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:28:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:28:24,488 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:28:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:28:24,632 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-11-09 22:28:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:28:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-09 22:28:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:28:24,633 INFO L225 Difference]: With dead ends: 60 [2024-11-09 22:28:24,633 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:28:24,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:28:24,634 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:28:24,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:28:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:28:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 22:28:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:28:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-09 22:28:24,648 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 24 [2024-11-09 22:28:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:28:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-09 22:28:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:28:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-09 22:28:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:28:24,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:28:24,649 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:24,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:28:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:24,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:28:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:28:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 594587768, now seen corresponding path program 1 times [2024-11-09 22:28:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:28:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335143345] [2024-11-09 22:28:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:28:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:28:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2950437] [2024-11-09 22:28:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:28:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:24,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:28:24,891 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-09 22:28:24,892 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-09 22:28:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:28:24,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:28:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:28:24,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:28:24,979 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:28:24,980 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:28:24,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 22:28:25,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:28:25,185 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:28:25,211 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:28:25,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:28:25 BoogieIcfgContainer [2024-11-09 22:28:25,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:28:25,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:28:25,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:28:25,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:28:25,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:28:22" (3/4) ... [2024-11-09 22:28:25,216 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:28:25,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:28:25,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:28:25,289 INFO L158 Benchmark]: Toolchain (without parser) took 3557.61ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 59.6MB in the beginning and 139.4MB in the end (delta: -79.8MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,289 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:28:25,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.90ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 59.3MB in the beginning and 141.6MB in the end (delta: -82.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 172.0MB. Free memory was 141.6MB in the beginning and 140.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,290 INFO L158 Benchmark]: Boogie Preprocessor took 34.87ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,290 INFO L158 Benchmark]: IcfgBuilder took 314.49ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 125.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,291 INFO L158 Benchmark]: TraceAbstraction took 2812.32ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 58.8MB in the end (delta: 67.0MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,291 INFO L158 Benchmark]: Witness Printer took 74.92ms. Allocated memory is still 172.0MB. Free memory was 58.8MB in the beginning and 139.4MB in the end (delta: -80.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-09 22:28:25,292 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.16ms. Allocated memory is still 130.0MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.90ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 59.3MB in the beginning and 141.6MB in the end (delta: -82.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 172.0MB. Free memory was 141.6MB in the beginning and 140.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.87ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 314.49ms. Allocated memory is still 172.0MB. Free memory was 138.5MB in the beginning and 125.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2812.32ms. Allocated memory is still 172.0MB. Free memory was 125.9MB in the beginning and 58.8MB in the end (delta: 67.0MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * Witness Printer took 74.92ms. Allocated memory is still 172.0MB. Free memory was 58.8MB in the beginning and 139.4MB in the end (delta: -80.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=32767, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<1 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=32767, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=32767, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=32767, counter=2, n=1, x=1, y=7, z=12] [L33] COND FALSE !(counter++<1) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=32767, counter=2, n=1, x=1, y=7, z=12] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=2] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=2] [L17] reach_error() VAL [\old(cond)=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 607 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 211 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 3 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 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-09 22:28:25,308 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