./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_4.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/loop-simple/nested_4.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 fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:36:14,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:36:14,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:36:14,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:36:14,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:36:14,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:36:14,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:36:14,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:36:14,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:36:14,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:36:14,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:36:14,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:36:14,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:36:14,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:36:14,816 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:36:14,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:36:14,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:36:14,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:36:14,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:36:14,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:36:14,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:36:14,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:36:14,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:36:14,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:36:14,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:36:14,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:36:14,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:36:14,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:36:14,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:36:14,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:36:14,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:36:14,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:36:14,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:36:14,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:36:14,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:36:14,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:36:14,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:36:14,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:36:14,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:36:14,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:36:14,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:36:14,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:36:14,828 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 -> fcf77da5263056f8d62c4caf3b92919690d80ef4ff864a75d0d8d1eec10bdccf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:36:15,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:36:15,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:36:15,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:36:15,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:36:15,217 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:36:15,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_4.c [2024-09-25 10:36:16,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:36:16,983 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:36:16,984 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_4.c [2024-09-25 10:36:16,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c8afa7e43/7d39f701649547f5a9b0f10cacd55aa6/FLAGd845a6fb6 [2024-09-25 10:36:17,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c8afa7e43/7d39f701649547f5a9b0f10cacd55aa6 [2024-09-25 10:36:17,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:36:17,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:36:17,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:36:17,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:36:17,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:36:17,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526ec984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17, skipping insertion in model container [2024-09-25 10:36:17,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:36:17,571 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_4.c[841,854] [2024-09-25 10:36:17,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:36:17,595 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:36:17,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_4.c[841,854] [2024-09-25 10:36:17,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:36:17,626 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:36:17,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17 WrapperNode [2024-09-25 10:36:17,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:36:17,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:36:17,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:36:17,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:36:17,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,646 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:36:17,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:36:17,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:36:17,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:36:17,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:36:17,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,670 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-25 10:36:17,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:36:17,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:36:17,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:36:17,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:36:17,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (1/1) ... [2024-09-25 10:36:17,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:36:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:17,718 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-25 10:36:17,721 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-25 10:36:17,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:36:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:36:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:36:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:36:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:36:17,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:36:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:36:17,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:36:17,816 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:36:17,818 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:36:18,018 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-25 10:36:18,018 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:36:18,052 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:36:18,052 INFO L317 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-25 10:36:18,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:36:18 BoogieIcfgContainer [2024-09-25 10:36:18,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:36:18,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:36:18,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:36:18,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:36:18,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:36:17" (1/3) ... [2024-09-25 10:36:18,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8156b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:36:18, skipping insertion in model container [2024-09-25 10:36:18,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:36:17" (2/3) ... [2024-09-25 10:36:18,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8156b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:36:18, skipping insertion in model container [2024-09-25 10:36:18,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:36:18" (3/3) ... [2024-09-25 10:36:18,063 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_4.c [2024-09-25 10:36:18,081 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:36:18,081 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:36:18,147 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:36:18,154 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;@47a207a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:36:18,155 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:36:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:36:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-25 10:36:18,165 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:18,166 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:18,166 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:18,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1429086249, now seen corresponding path program 1 times [2024-09-25 10:36:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647152170] [2024-09-25 10:36:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:18,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:18,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647152170] [2024-09-25 10:36:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647152170] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:18,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:18,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:36:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072198393] [2024-09-25 10:36:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:18,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:36:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:36:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:36:18,356 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:18,382 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2024-09-25 10:36:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:36:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-25 10:36:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:18,390 INFO L225 Difference]: With dead ends: 33 [2024-09-25 10:36:18,390 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:36:18,400 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-25 10:36:18,407 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:18,408 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:36:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:36:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-09-25 10:36:18,438 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2024-09-25 10:36:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:18,439 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-09-25 10:36:18,439 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-09-25 10:36:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-25 10:36:18,441 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:18,441 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:18,441 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:36:18,441 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:18,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1429126611, now seen corresponding path program 1 times [2024-09-25 10:36:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820655043] [2024-09-25 10:36:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820655043] [2024-09-25 10:36:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820655043] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:18,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999571499] [2024-09-25 10:36:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:18,533 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:18,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:18,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,534 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:18,578 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-25 10:36:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-25 10:36:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:18,580 INFO L225 Difference]: With dead ends: 25 [2024-09-25 10:36:18,580 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:36:18,581 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,582 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:18,584 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:18,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:36:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2024-09-25 10:36:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-09-25 10:36:18,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2024-09-25 10:36:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:18,595 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-09-25 10:36:18,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-09-25 10:36:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:36:18,598 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:18,599 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:18,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:36:18,600 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:18,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 921905310, now seen corresponding path program 1 times [2024-09-25 10:36:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:18,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979411228] [2024-09-25 10:36:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979411228] [2024-09-25 10:36:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979411228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703818311] [2024-09-25 10:36:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:18,708 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,714 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:18,750 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-25 10:36:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:36:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:18,753 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:36:18,754 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 10:36:18,755 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,756 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:18,759 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 10:36:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-09-25 10:36:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-09-25 10:36:18,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2024-09-25 10:36:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:18,770 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-09-25 10:36:18,770 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-09-25 10:36:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:36:18,774 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:18,774 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:18,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:36:18,775 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:18,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1474006703, now seen corresponding path program 1 times [2024-09-25 10:36:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:18,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758683522] [2024-09-25 10:36:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:18,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758683522] [2024-09-25 10:36:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758683522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093963048] [2024-09-25 10:36:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:18,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:18,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,847 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:18,870 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 10:36:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-25 10:36:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:18,873 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:36:18,873 INFO L226 Difference]: Without dead ends: 20 [2024-09-25 10:36:18,874 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,877 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:18,877 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-25 10:36:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-25 10:36:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-25 10:36:18,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2024-09-25 10:36:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:18,885 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-25 10:36:18,886 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:18,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-25 10:36:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:36:18,889 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:18,889 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:18,889 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:36:18,889 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:18,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash -518581990, now seen corresponding path program 1 times [2024-09-25 10:36:18,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728341865] [2024-09-25 10:36:18,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728341865] [2024-09-25 10:36:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728341865] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:36:18,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:36:18,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:36:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072880129] [2024-09-25 10:36:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:36:18,991 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:36:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:36:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:18,992 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:19,039 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-09-25 10:36:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:36:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:36:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:19,043 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:36:19,043 INFO L226 Difference]: Without dead ends: 19 [2024-09-25 10:36:19,044 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:36:19,044 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:19,045 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-25 10:36:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-25 10:36:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-09-25 10:36:19,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2024-09-25 10:36:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:19,055 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-09-25 10:36:19,056 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-09-25 10:36:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:36:19,059 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:19,059 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:19,060 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:36:19,061 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:19,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1881243200, now seen corresponding path program 1 times [2024-09-25 10:36:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896253941] [2024-09-25 10:36:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:19,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896253941] [2024-09-25 10:36:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896253941] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:19,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177818070] [2024-09-25 10:36:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:19,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:19,132 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-25 10:36:19,134 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-25 10:36:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:19,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:36:19,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:19,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177818070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:19,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:36:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158877889] [2024-09-25 10:36:19,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:19,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:36:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:36:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:36:19,270 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:19,310 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-25 10:36:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:36:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-25 10:36:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:19,315 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:36:19,315 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:36:19,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:36:19,317 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:19,317 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:36:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:36:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-09-25 10:36:19,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2024-09-25 10:36:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:19,325 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-09-25 10:36:19,325 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-09-25 10:36:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:36:19,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:19,327 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:19,346 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:36:19,527 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:36:19,528 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:19,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash 264309402, now seen corresponding path program 2 times [2024-09-25 10:36:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:19,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337273328] [2024-09-25 10:36:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:19,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:36:19,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337273328] [2024-09-25 10:36:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337273328] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:19,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378298159] [2024-09-25 10:36:19,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:36:19,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:19,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:19,604 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-25 10:36:19,606 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-25 10:36:19,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:36:19,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:19,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:36:19,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:19,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:36:19,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378298159] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:19,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-25 10:36:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501430829] [2024-09-25 10:36:19,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:19,784 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:36:19,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:19,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:36:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:36:19,785 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:19,958 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2024-09-25 10:36:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 10:36:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:36:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:19,960 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:36:19,960 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:36:19,961 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:36:19,961 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:19,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:36:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-09-25 10:36:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 10:36:19,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2024-09-25 10:36:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:19,970 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 10:36:19,970 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:19,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 10:36:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:36:19,972 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:19,972 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:19,985 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:36:20,175 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:36:20,175 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:20,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 795945841, now seen corresponding path program 3 times [2024-09-25 10:36:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:20,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616109820] [2024-09-25 10:36:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:20,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-25 10:36:20,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:20,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616109820] [2024-09-25 10:36:20,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616109820] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:20,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517515542] [2024-09-25 10:36:20,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:36:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:20,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:20,260 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-25 10:36:20,261 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-25 10:36:20,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:36:20,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:20,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-25 10:36:20,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-25 10:36:20,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-09-25 10:36:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517515542] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:20,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-25 10:36:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708940923] [2024-09-25 10:36:20,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:20,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:36:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:36:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:36:20,442 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:20,610 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2024-09-25 10:36:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:36:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-09-25 10:36:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:20,614 INFO L225 Difference]: With dead ends: 296 [2024-09-25 10:36:20,614 INFO L226 Difference]: Without dead ends: 269 [2024-09-25 10:36:20,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:36:20,616 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 70 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:20,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 49 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:36:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-09-25 10:36:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2024-09-25 10:36:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.1567567567567567) internal successors, (214), 185 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 217 transitions. [2024-09-25 10:36:20,670 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 217 transitions. Word has length 32 [2024-09-25 10:36:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:20,670 INFO L474 AbstractCegarLoop]: Abstraction has 189 states and 217 transitions. [2024-09-25 10:36:20,671 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:20,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2024-09-25 10:36:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-09-25 10:36:20,680 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:20,680 INFO L216 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:20,698 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:36:20,884 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:36:20,885 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:20,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash 524786029, now seen corresponding path program 4 times [2024-09-25 10:36:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346901263] [2024-09-25 10:36:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-25 10:36:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346901263] [2024-09-25 10:36:21,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346901263] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:21,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132720567] [2024-09-25 10:36:21,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:36:21,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:21,180 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-25 10:36:21,181 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-25 10:36:21,296 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:36:21,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:21,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:36:21,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:21,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-25 10:36:21,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6722 backedges. 1478 proven. 53 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2024-09-25 10:36:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132720567] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:21,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:36:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669043489] [2024-09-25 10:36:21,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:21,462 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:36:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:36:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:21,465 INFO L87 Difference]: Start difference. First operand 189 states and 217 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:21,578 INFO L93 Difference]: Finished difference Result 640 states and 757 transitions. [2024-09-25 10:36:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:36:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 188 [2024-09-25 10:36:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:21,582 INFO L225 Difference]: With dead ends: 640 [2024-09-25 10:36:21,582 INFO L226 Difference]: Without dead ends: 477 [2024-09-25 10:36:21,583 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:21,584 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:21,584 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-09-25 10:36:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-09-25 10:36:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 473 states have (on average 1.1289640591966172) internal successors, (534), 473 states have internal predecessors, (534), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 537 transitions. [2024-09-25 10:36:21,676 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 537 transitions. Word has length 188 [2024-09-25 10:36:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:21,680 INFO L474 AbstractCegarLoop]: Abstraction has 477 states and 537 transitions. [2024-09-25 10:36:21,680 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:21,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 537 transitions. [2024-09-25 10:36:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-09-25 10:36:21,690 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:21,690 INFO L216 NwaCegarLoop]: trace histogram [288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:21,710 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:36:21,896 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:21,896 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:21,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -295793811, now seen corresponding path program 5 times [2024-09-25 10:36:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92336408] [2024-09-25 10:36:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 22231 proven. 1853 refuted. 0 times theorem prover too weak. 34974 trivial. 0 not checked. [2024-09-25 10:36:22,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92336408] [2024-09-25 10:36:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92336408] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:22,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827692964] [2024-09-25 10:36:22,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:36:22,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:22,406 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-25 10:36:22,408 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-25 10:36:22,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2024-09-25 10:36:22,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:22,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:36:22,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-09-25 10:36:22,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 59058 backedges. 37054 proven. 1853 refuted. 0 times theorem prover too weak. 20151 trivial. 0 not checked. [2024-09-25 10:36:22,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827692964] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:22,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:36:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034689860] [2024-09-25 10:36:22,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:22,981 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:36:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:36:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:22,982 INFO L87 Difference]: Start difference. First operand 477 states and 537 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:23,187 INFO L93 Difference]: Finished difference Result 1745 states and 1978 transitions. [2024-09-25 10:36:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:36:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 476 [2024-09-25 10:36:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:23,194 INFO L225 Difference]: With dead ends: 1745 [2024-09-25 10:36:23,194 INFO L226 Difference]: Without dead ends: 1389 [2024-09-25 10:36:23,196 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:36:23,197 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:23,197 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:36:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-09-25 10:36:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1389. [2024-09-25 10:36:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1385 states have (on average 1.1249097472924188) internal successors, (1558), 1385 states have internal predecessors, (1558), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1561 transitions. [2024-09-25 10:36:23,395 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1561 transitions. Word has length 476 [2024-09-25 10:36:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:23,395 INFO L474 AbstractCegarLoop]: Abstraction has 1389 states and 1561 transitions. [2024-09-25 10:36:23,396 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:23,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1561 transitions. [2024-09-25 10:36:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1389 [2024-09-25 10:36:23,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:36:23,455 INFO L216 NwaCegarLoop]: trace histogram [864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:36:23,472 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:36:23,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:36:23,659 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:36:23,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2030357395, now seen corresponding path program 6 times [2024-09-25 10:36:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:36:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426888864] [2024-09-25 10:36:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:36:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:36:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:26,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 0 proven. 399910 refuted. 0 times theorem prover too weak. 132612 trivial. 0 not checked. [2024-09-25 10:36:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426888864] [2024-09-25 10:36:26,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426888864] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417294796] [2024-09-25 10:36:26,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:36:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:26,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:26,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:36:26,463 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:36:27,539 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 233 check-sat command(s) [2024-09-25 10:36:27,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:27,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 2205 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 10:36:27,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 209210 proven. 792 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-09-25 10:36:28,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:36:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 532522 backedges. 199954 proven. 10048 refuted. 0 times theorem prover too weak. 322520 trivial. 0 not checked. [2024-09-25 10:36:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417294796] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:36:30,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:36:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 21] total 43 [2024-09-25 10:36:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036285128] [2024-09-25 10:36:30,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:36:30,561 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-25 10:36:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:36:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-25 10:36:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2024-09-25 10:36:30,563 INFO L87 Difference]: Start difference. First operand 1389 states and 1561 transitions. Second operand has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:36:33,225 INFO L93 Difference]: Finished difference Result 3413 states and 3841 transitions. [2024-09-25 10:36:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-09-25 10:36:33,225 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 1388 [2024-09-25 10:36:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:36:33,231 INFO L225 Difference]: With dead ends: 3413 [2024-09-25 10:36:33,231 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:36:33,242 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2879 GetRequests, 2743 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5663 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2980, Invalid=15926, Unknown=0, NotChecked=0, Total=18906 [2024-09-25 10:36:33,243 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 155 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:36:33,243 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 144 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:36:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:36:33,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:36:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:36:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:36:33,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1388 [2024-09-25 10:36:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:36:33,247 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:36:33,247 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 43 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:36:33,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:36:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:36:33,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:36:33,250 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:36:33,271 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:36:33,451 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:36:33,454 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-09-25 10:36:33,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:37:56,501 WARN L293 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 1746 DAG size of output: 1554 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-09-25 10:38:45,992 WARN L293 SmtUtils]: Spent 46.47s on a formula simplification. DAG size of input: 1554 DAG size of output: 39 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 10:38:46,110 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:38:46,133 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:38:46,134 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:38:46,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:38:46 BoogieIcfgContainer [2024-09-25 10:38:46,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:38:46,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:38:46,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:38:46,135 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:38:46,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:36:18" (3/4) ... [2024-09-25 10:38:46,137 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:38:46,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:38:46,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:38:46,195 INFO L158 Benchmark]: Toolchain (without parser) took 148810.11ms. Allocated memory was 65.0MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 33.1MB in the beginning and 688.6MB in the end (delta: -655.5MB). Peak memory consumption was 421.7MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,195 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 46.1MB. Free memory was 27.0MB in the beginning and 27.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:38:46,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.60ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 39.9MB in the end (delta: -7.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.73ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 39.0MB in the end (delta: 962.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:38:46,196 INFO L158 Benchmark]: Boogie Preprocessor took 39.42ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,197 INFO L158 Benchmark]: RCFGBuilder took 365.25ms. Allocated memory is still 65.0MB. Free memory was 37.4MB in the beginning and 43.6MB in the end (delta: -6.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,197 INFO L158 Benchmark]: TraceAbstraction took 148080.22ms. Allocated memory was 65.0MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 43.0MB in the beginning and 691.8MB in the end (delta: -648.8MB). Peak memory consumption was 722.5MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,198 INFO L158 Benchmark]: Witness Printer took 59.59ms. Allocated memory is still 1.1GB. Free memory was 691.8MB in the beginning and 688.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:38:46,200 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.25ms. Allocated memory is still 46.1MB. Free memory was 27.0MB in the beginning and 27.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.60ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 39.9MB in the end (delta: -7.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.73ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 39.0MB in the end (delta: 962.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.42ms. Allocated memory is still 65.0MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.25ms. Allocated memory is still 65.0MB. Free memory was 37.4MB in the beginning and 43.6MB in the end (delta: -6.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 148080.22ms. Allocated memory was 65.0MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 43.0MB in the beginning and 691.8MB in the end (delta: -648.8MB). Peak memory consumption was 722.5MB. Max. memory is 16.1GB. * Witness Printer took 59.59ms. Allocated memory is still 1.1GB. Free memory was 691.8MB in the beginning and 688.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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 - PositiveResult [Line: 32]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 11, TraceHistogramMax: 864, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 156 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4424 GetRequests, 4227 SyntacticMatches, 4 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5801 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1389occurred in iteration=10, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 100 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 4304 NumberOfCodeBlocks, 3408 NumberOfCodeBlocksAsserted, 300 NumberOfCheckSat, 6404 ConstructedInterpolants, 0 QuantifiedInterpolants, 13420 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3265 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 1378759/1795254 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((b == 6) && (c == 6)) && (a <= 6)) && (d == 6)) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (((((((((((((((b <= 5) && (5 == c)) && (d == 1)) && (a <= 5)) || ((((b <= 5) && (d == 3)) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 1))) || ((((d == 4) && (b <= 5)) && (5 == c)) && (a <= 5))) || ((((d == 0) && (b <= 5)) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || ((((b <= 5) && (5 == c)) && (d == 2)) && (a <= 5))) || (((b <= 5) && (c == 0)) && (a <= 5))) || ((((b <= 5) && (5 == c)) && (d == 6)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) || ((((b <= 5) && (5 == c)) && (5 == d)) && (a <= 5))) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((b <= 5) && (a <= 5)) && (c == 1)) || (((b <= 5) && (5 == c)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || ((((c == 6) && (b <= 5)) && (d == 6)) && (a <= 5))) || (((b <= 5) && (c == 0)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((c == 6) && (b <= 6)) && (d == 6)) && (a <= 5)) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:38:46,236 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE