./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:22:01,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:22:01,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:22:01,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:22:01,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:22:01,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:22:01,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:22:01,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:22:01,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:22:01,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:22:01,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:22:01,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:22:01,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:22:01,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:22:01,942 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:22:01,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:22:01,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:22:01,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:22:01,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:22:01,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:22:01,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:22:01,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:22:01,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:22:01,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:22:01,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:22:01,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:22:01,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:22:01,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:22:01,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:22:01,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:22:01,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:22:01,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:22:01,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:22:01,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:22:01,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:22:01,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:22:01,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:22:01,949 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 2436c69c19f049d89ef519f7bd9d4cf3f7b648737fca21472b0299c532d84f11 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:22:02,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:22:02,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:22:02,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:22:02,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:22:02,199 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:22:02,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2024-09-11 20:22:03,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:22:03,664 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:22:03,665 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c [2024-09-11 20:22:03,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5ad1595d0/61108dae0a9c4593a443b22b34d13c98/FLAG60faf8744 [2024-09-11 20:22:03,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5ad1595d0/61108dae0a9c4593a443b22b34d13c98 [2024-09-11 20:22:03,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:22:03,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:22:03,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:22:03,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:22:03,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:22:03,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21253ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03, skipping insertion in model container [2024-09-11 20:22:03,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:22:03,839 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c[458,471] [2024-09-11 20:22:03,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:22:03,869 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:22:03,885 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound100.c[458,471] [2024-09-11 20:22:03,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:22:03,908 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:22:03,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03 WrapperNode [2024-09-11 20:22:03,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:22:03,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:22:03,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:22:03,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:22:03,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,936 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-09-11 20:22:03,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:22:03,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:22:03,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:22:03,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:22:03,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,956 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-09-11 20:22:03,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:22:03,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:22:03,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:22:03,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:22:03,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (1/1) ... [2024-09-11 20:22:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:22:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:04,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:22:04,016 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:22:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:22:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:22:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:22:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:22:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:22:04,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:22:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:22:04,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:22:04,100 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:22:04,102 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:22:04,187 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:22:04,187 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:22:04,208 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:22:04,208 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 20:22:04,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:22:04 BoogieIcfgContainer [2024-09-11 20:22:04,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:22:04,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:22:04,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:22:04,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:22:04,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:22:03" (1/3) ... [2024-09-11 20:22:04,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:22:04, skipping insertion in model container [2024-09-11 20:22:04,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:03" (2/3) ... [2024-09-11 20:22:04,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:22:04, skipping insertion in model container [2024-09-11 20:22:04,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:22:04" (3/3) ... [2024-09-11 20:22:04,217 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound100.c [2024-09-11 20:22:04,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:22:04,256 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:22:04,315 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:22:04,322 INFO L336 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=All, 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;@48bf3d35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:22:04,323 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:22:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 20:22:04,333 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:04,334 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:04,334 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:04,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2024-09-11 20:22:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975663559] [2024-09-11 20:22:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:04,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:22:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:04,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 20:22:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:22:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975663559] [2024-09-11 20:22:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975663559] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:22:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:22:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:22:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977261745] [2024-09-11 20:22:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:04,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:22:04,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:22:04,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:22:04,518 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:22:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:04,540 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2024-09-11 20:22:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:22:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-11 20:22:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:04,547 INFO L225 Difference]: With dead ends: 40 [2024-09-11 20:22:04,548 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 20:22:04,550 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-09-11 20:22:04,553 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:04,553 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 20:22:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 20:22:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:22:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-09-11 20:22:04,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2024-09-11 20:22:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:04,583 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-09-11 20:22:04,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:22:04,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-09-11 20:22:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 20:22:04,585 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:04,585 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:04,585 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:22:04,585 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:04,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2024-09-11 20:22:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903062277] [2024-09-11 20:22:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:04,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905614741] [2024-09-11 20:22:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:04,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:04,613 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:22:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:04,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:22:04,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:22:04,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:22:04,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903062277] [2024-09-11 20:22:04,742 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905614741] [2024-09-11 20:22:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905614741] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:22:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:22:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:22:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992314795] [2024-09-11 20:22:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:04,744 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:22:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:22:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:22:04,746 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 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-09-11 20:22:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:04,822 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-09-11 20:22:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:22:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 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 17 [2024-09-11 20:22:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:04,824 INFO L225 Difference]: With dead ends: 30 [2024-09-11 20:22:04,824 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 20:22:04,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-09-11 20:22:04,825 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:04,826 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 20:22:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 20:22:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-09-11 20:22:04,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2024-09-11 20:22:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:04,838 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-09-11 20:22:04,838 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 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-09-11 20:22:04,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-09-11 20:22:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:22:04,840 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:04,840 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:04,853 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:22:05,044 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:05,046 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:05,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2024-09-11 20:22:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304372160] [2024-09-11 20:22:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:05,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298044427] [2024-09-11 20:22:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:05,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:22:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:05,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:22:05,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:22:05,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:22:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304372160] [2024-09-11 20:22:05,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298044427] [2024-09-11 20:22:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298044427] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:22:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:22:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:22:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234204404] [2024-09-11 20:22:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:05,253 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:22:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:22:05,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:22:05,254 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:22:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:05,302 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-09-11 20:22:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:22:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-11 20:22:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:05,304 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:22:05,304 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:22:05,305 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:22:05,306 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:05,306 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:22:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:22:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-09-11 20:22:05,319 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2024-09-11 20:22:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:05,320 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-09-11 20:22:05,320 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:22:05,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-09-11 20:22:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:22:05,335 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:05,335 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:05,361 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:22:05,541 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:05,542 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:05,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2024-09-11 20:22:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344264276] [2024-09-11 20:22:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848387770] [2024-09-11 20:22:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:05,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:05,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:05,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:05,602 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:22:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:05,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 20:22:05,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:22:05,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:22:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344264276] [2024-09-11 20:22:05,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848387770] [2024-09-11 20:22:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848387770] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:22:05,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:22:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:22:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145584284] [2024-09-11 20:22:05,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:22:05,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:22:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:22:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:22:05,878 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:22:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:05,995 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-09-11 20:22:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:22:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2024-09-11 20:22:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:05,996 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:22:05,996 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:22:05,997 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-11 20:22:05,998 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:05,998 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:22:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:22:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-11 20:22:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:22:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-09-11 20:22:06,019 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2024-09-11 20:22:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:06,020 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-09-11 20:22:06,020 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:22:06,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-09-11 20:22:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-11 20:22:06,021 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:06,022 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:06,036 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:22:06,225 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:06,226 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:06,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash 459274687, now seen corresponding path program 2 times [2024-09-11 20:22:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:06,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323725251] [2024-09-11 20:22:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064195074] [2024-09-11 20:22:06,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:22:06,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:06,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:06,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:06,281 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:22:06,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:22:06,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:22:06,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 20:22:06,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-09-11 20:22:06,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 20:22:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323725251] [2024-09-11 20:22:06,858 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064195074] [2024-09-11 20:22:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064195074] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:22:06,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:22:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-09-11 20:22:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941685124] [2024-09-11 20:22:06,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:22:06,860 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:22:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:22:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:22:06,861 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-11 20:22:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:07,623 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-09-11 20:22:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:22:07,623 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 56 [2024-09-11 20:22:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:07,627 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:22:07,627 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:22:07,628 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:22:07,628 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:07,628 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 313 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:22:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:22:07,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-09-11 20:22:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 20:22:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-09-11 20:22:07,666 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 56 [2024-09-11 20:22:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:07,666 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-09-11 20:22:07,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-11 20:22:07,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-09-11 20:22:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-11 20:22:07,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:07,671 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:07,686 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:22:07,872 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:07,872 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:07,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1077833742, now seen corresponding path program 3 times [2024-09-11 20:22:07,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:07,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291223757] [2024-09-11 20:22:07,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203039989] [2024-09-11 20:22:08,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:22:08,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:08,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:08,021 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:22:08,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-11 20:22:08,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:22:08,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-11 20:22:08,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 45 proven. 142 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-09-11 20:22:08,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:16,722 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_ULTIMATE.start_main_~y~0#1| (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:22:28,787 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:22:45,366 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:22:52,700 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10)) 30) 0) (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|)))))) is different from true [2024-09-11 20:23:09,005 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:25,038 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:29,043 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| 10)) 30) 0) (= (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_26|)) (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_39|))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-11 20:23:38,291 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0)) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)))) is different from false [2024-09-11 20:23:57,650 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 3) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 3))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:24:13,718 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 4)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 4))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:24:29,766 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 5)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 5))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:24:45,895 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 6))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:25:02,605 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2024-09-11 20:25:18,688 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 8)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 8))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false