./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_3.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/loops-crafted-1/mono-crafted_3.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 4548c451706b7658e6a882e8eef66dc3c360e6aea0e4326d7cc0b87e2b58239c --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:31:37,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:31:37,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:31:37,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:31:37,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:31:37,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:31:37,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:31:37,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:31:37,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:31:37,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:31:37,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:31:37,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:31:37,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:31:37,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:31:37,729 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:31:37,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:31:37,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:31:37,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:31:37,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:31:37,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:31:37,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:31:37,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:31:37,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:31:37,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:31:37,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:31:37,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:31:37,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:31:37,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:31:37,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:31:37,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:31:37,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:31:37,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:31:37,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:37,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:31:37,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:31:37,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:31:37,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:31:37,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:31:37,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:31:37,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:31:37,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:31:37,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:31:37,738 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 -> 4548c451706b7658e6a882e8eef66dc3c360e6aea0e4326d7cc0b87e2b58239c 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:31:38,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:31:38,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:31:38,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:31:38,030 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:31:38,030 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:31:38,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c [2024-09-25 10:31:39,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:31:39,537 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:31:39,538 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_3.c [2024-09-25 10:31:39,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6f4fb46ca/3391b4b85f15479a844d043b1077f297/FLAGad946fb58 [2024-09-25 10:31:39,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6f4fb46ca/3391b4b85f15479a844d043b1077f297 [2024-09-25 10:31:39,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:31:39,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:31:39,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:39,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:31:39,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:31:39,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7f2ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39, skipping insertion in model container [2024-09-25 10:31:39,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:31:39,714 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/loops-crafted-1/mono-crafted_3.c[318,331] [2024-09-25 10:31:39,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:39,740 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:31:39,749 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/loops-crafted-1/mono-crafted_3.c[318,331] [2024-09-25 10:31:39,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:39,769 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:31:39,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39 WrapperNode [2024-09-25 10:31:39,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:39,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:39,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:31:39,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:31:39,778 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:31:39" (1/1) ... [2024-09-25 10:31:39,783 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:31:39" (1/1) ... [2024-09-25 10:31:39,788 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:31:39,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:39,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:31:39,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:31:39,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:31:39,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,812 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:31:39,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:31:39,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:31:39,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:31:39,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:31:39,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (1/1) ... [2024-09-25 10:31:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:39,858 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:31:39,867 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:31:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:31:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:31:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:31:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:31:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:31:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:31:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:31:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:31:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:31:39,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:31:39,959 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:31:39,961 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:31:40,089 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:31:40,090 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:31:40,111 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:31:40,113 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:31:40,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:40 BoogieIcfgContainer [2024-09-25 10:31:40,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:31:40,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:31:40,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:31:40,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:31:40,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:31:39" (1/3) ... [2024-09-25 10:31:40,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471abaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:40, skipping insertion in model container [2024-09-25 10:31:40,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:39" (2/3) ... [2024-09-25 10:31:40,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6471abaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:40, skipping insertion in model container [2024-09-25 10:31:40,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:40" (3/3) ... [2024-09-25 10:31:40,123 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_3.c [2024-09-25 10:31:40,138 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:31:40,139 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:31:40,192 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:31:40,199 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;@4c5d294c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:31:40,199 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:31:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:40,210 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:40,211 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:40,211 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:40,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash -630439525, now seen corresponding path program 1 times [2024-09-25 10:31:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:40,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018616988] [2024-09-25 10:31:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,358 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:31:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:40,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018616988] [2024-09-25 10:31:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018616988] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:40,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:40,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:31:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653358357] [2024-09-25 10:31:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:40,366 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:31:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:31:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:40,389 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:40,409 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 10:31:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:31:40,411 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:31:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:40,415 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:31:40,416 INFO L226 Difference]: Without dead ends: 13 [2024-09-25 10:31:40,417 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:31:40,420 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:40,421 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-25 10:31:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-25 10:31:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-25 10:31:40,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2024-09-25 10:31:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:40,447 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-25 10:31:40,448 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-25 10:31:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:40,450 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:40,450 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:40,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:31:40,451 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:40,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash -920425119, now seen corresponding path program 1 times [2024-09-25 10:31:40,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:40,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924897117] [2024-09-25 10:31:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,544 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:31:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924897117] [2024-09-25 10:31:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924897117] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605187847] [2024-09-25 10:31:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:40,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:40,549 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:40,569 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2024-09-25 10:31:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:31:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:40,570 INFO L225 Difference]: With dead ends: 23 [2024-09-25 10:31:40,570 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:31:40,570 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:31:40,571 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:40,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:31:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:31:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-25 10:31:40,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-25 10:31:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:40,576 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-25 10:31:40,576 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-25 10:31:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:31:40,577 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:40,577 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:40,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:31:40,578 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:40,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 478481828, now seen corresponding path program 1 times [2024-09-25 10:31:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081890949] [2024-09-25 10:31:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:40,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081890949] [2024-09-25 10:31:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081890949] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:40,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:40,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311253371] [2024-09-25 10:31:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:40,632 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:40,635 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:40,655 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-25 10:31:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 10:31:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:40,656 INFO L225 Difference]: With dead ends: 21 [2024-09-25 10:31:40,656 INFO L226 Difference]: Without dead ends: 16 [2024-09-25 10:31:40,657 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:31:40,658 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:40,658 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-25 10:31:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-25 10:31:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-25 10:31:40,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2024-09-25 10:31:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:40,662 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-25 10:31:40,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-25 10:31:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:31:40,664 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:40,664 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:40,664 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:31:40,664 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:40,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1983572541, now seen corresponding path program 1 times [2024-09-25 10:31:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:40,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022819099] [2024-09-25 10:31:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022819099] [2024-09-25 10:31:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022819099] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285030865] [2024-09-25 10:31:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:40,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:40,751 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:31:40,752 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:31:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:31:40,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:40,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285030865] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:40,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:40,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-25 10:31:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996618187] [2024-09-25 10:31:40,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:40,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:31:40,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:31:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:31:40,901 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:41,002 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2024-09-25 10:31:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:31:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:41,004 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:31:41,004 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:31:41,004 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:31:41,005 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:41,005 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:31:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:31:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-09-25 10:31:41,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2024-09-25 10:31:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:41,016 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-09-25 10:31:41,016 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:41,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-09-25 10:31:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:31:41,018 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:41,018 INFO L216 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:41,038 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:31:41,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:41,219 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:41,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1818917457, now seen corresponding path program 1 times [2024-09-25 10:31:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889272315] [2024-09-25 10:31:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:41,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:41,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889272315] [2024-09-25 10:31:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889272315] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029163642] [2024-09-25 10:31:41,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:41,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:41,355 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:31:41,360 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:31:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:41,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:41,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:41,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:41,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029163642] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:41,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:41,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:31:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724571075] [2024-09-25 10:31:41,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:41,503 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:31:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:31:41,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:41,504 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:41,553 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-25 10:31:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 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:31:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:41,554 INFO L225 Difference]: With dead ends: 43 [2024-09-25 10:31:41,554 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 10:31:41,554 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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:31:41,555 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:41,555 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 10:31:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 10:31:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-25 10:31:41,561 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-09-25 10:31:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:41,562 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-25 10:31:41,562 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:41,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-25 10:31:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:31:41,563 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:41,563 INFO L216 NwaCegarLoop]: trace histogram [8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:41,577 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:31:41,766 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:41,767 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:41,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash -244817955, now seen corresponding path program 2 times [2024-09-25 10:31:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237039999] [2024-09-25 10:31:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:41,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:41,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:41,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237039999] [2024-09-25 10:31:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237039999] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249478243] [2024-09-25 10:31:41,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:41,953 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:31:41,954 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:31:41,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:41,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:41,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:31:41,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:42,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249478243] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:42,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-25 10:31:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864574126] [2024-09-25 10:31:42,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:42,176 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:31:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:31:42,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:42,177 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:42,257 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-09-25 10:31:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:31:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-25 10:31:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:42,261 INFO L225 Difference]: With dead ends: 59 [2024-09-25 10:31:42,261 INFO L226 Difference]: Without dead ends: 46 [2024-09-25 10:31:42,261 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:42,262 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:42,262 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-25 10:31:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-25 10:31:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-09-25 10:31:42,272 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2024-09-25 10:31:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:42,272 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-09-25 10:31:42,273 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:42,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-09-25 10:31:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-25 10:31:42,276 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:42,276 INFO L216 NwaCegarLoop]: trace histogram [16, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:42,292 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:31:42,480 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:31:42,484 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:42,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1905739509, now seen corresponding path program 3 times [2024-09-25 10:31:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101700764] [2024-09-25 10:31:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:42,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101700764] [2024-09-25 10:31:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101700764] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007521516] [2024-09-25 10:31:42,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:42,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:42,844 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:31:42,845 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:31:42,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:31:42,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:42,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:42,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-09-25 10:31:42,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-09-25 10:31:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007521516] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:43,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 25 [2024-09-25 10:31:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750382307] [2024-09-25 10:31:43,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:43,091 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 10:31:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 10:31:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:31:43,092 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:43,345 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-09-25 10:31:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:31:43,345 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-09-25 10:31:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:43,346 INFO L225 Difference]: With dead ends: 71 [2024-09-25 10:31:43,346 INFO L226 Difference]: Without dead ends: 58 [2024-09-25 10:31:43,346 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=525, Invalid=1035, Unknown=0, NotChecked=0, Total=1560 [2024-09-25 10:31:43,347 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:43,347 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-25 10:31:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-09-25 10:31:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-09-25 10:31:43,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 45 [2024-09-25 10:31:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:43,353 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-09-25 10:31:43,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:43,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-09-25 10:31:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 10:31:43,355 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:43,355 INFO L216 NwaCegarLoop]: trace histogram [17, 15, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:43,368 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:31:43,555 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:43,555 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:43,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1704028856, now seen corresponding path program 4 times [2024-09-25 10:31:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884088746] [2024-09-25 10:31:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:43,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884088746] [2024-09-25 10:31:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884088746] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503422074] [2024-09-25 10:31:43,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:31:43,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:43,861 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:31:43,862 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:31:43,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:31:43,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:43,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-25 10:31:43,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:43,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503422074] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:44,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-09-25 10:31:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631088800] [2024-09-25 10:31:44,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:44,343 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-25 10:31:44,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-25 10:31:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:31:44,345 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:44,435 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2024-09-25 10:31:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-25 10:31:44,436 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-09-25 10:31:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:44,436 INFO L225 Difference]: With dead ends: 103 [2024-09-25 10:31:44,437 INFO L226 Difference]: Without dead ends: 86 [2024-09-25 10:31:44,437 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:31:44,438 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:44,438 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-25 10:31:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-25 10:31:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-09-25 10:31:44,447 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 51 [2024-09-25 10:31:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:44,447 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-09-25 10:31:44,447 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:44,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-09-25 10:31:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-25 10:31:44,449 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:44,449 INFO L216 NwaCegarLoop]: trace histogram [34, 32, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:44,463 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:31:44,653 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:31:44,654 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:44,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 753883691, now seen corresponding path program 5 times [2024-09-25 10:31:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240404116] [2024-09-25 10:31:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:45,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240404116] [2024-09-25 10:31:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240404116] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572519986] [2024-09-25 10:31:45,573 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:31:45,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:45,575 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:31:45,576 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:31:45,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2024-09-25 10:31:45,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:45,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-25 10:31:45,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:45,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572519986] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:46,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-09-25 10:31:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428649196] [2024-09-25 10:31:46,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:46,981 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-09-25 10:31:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-09-25 10:31:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2024-09-25 10:31:46,984 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:47,158 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2024-09-25 10:31:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-09-25 10:31:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-09-25 10:31:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:47,160 INFO L225 Difference]: With dead ends: 171 [2024-09-25 10:31:47,160 INFO L226 Difference]: Without dead ends: 154 [2024-09-25 10:31:47,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2024-09-25 10:31:47,162 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:47,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-09-25 10:31:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-09-25 10:31:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0268456375838926) internal successors, (153), 149 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2024-09-25 10:31:47,184 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 85 [2024-09-25 10:31:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:47,185 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2024-09-25 10:31:47,186 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:47,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2024-09-25 10:31:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-09-25 10:31:47,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:47,187 INFO L216 NwaCegarLoop]: trace histogram [68, 66, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:47,207 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:31:47,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:47,392 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:47,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1625920209, now seen corresponding path program 6 times [2024-09-25 10:31:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820550802] [2024-09-25 10:31:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:50,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 201 proven. 4422 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 10:31:50,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:50,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820550802] [2024-09-25 10:31:50,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820550802] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:50,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94482204] [2024-09-25 10:31:50,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:31:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:50,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:50,071 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:31:50,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 10:31:50,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:50,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:31:50,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 202 proven. 21 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2024-09-25 10:31:50,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 202 proven. 21 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2024-09-25 10:31:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94482204] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:50,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 10, 10] total 85 [2024-09-25 10:31:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968125548] [2024-09-25 10:31:50,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:50,776 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-09-25 10:31:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-09-25 10:31:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2498, Invalid=4642, Unknown=0, NotChecked=0, Total=7140 [2024-09-25 10:31:50,780 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand has 85 states, 85 states have (on average 2.023529411764706) internal successors, (172), 85 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:52,512 INFO L93 Difference]: Finished difference Result 187 states and 205 transitions. [2024-09-25 10:31:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-25 10:31:52,513 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 2.023529411764706) internal successors, (172), 85 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2024-09-25 10:31:52,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:52,516 INFO L225 Difference]: With dead ends: 187 [2024-09-25 10:31:52,516 INFO L226 Difference]: Without dead ends: 170 [2024-09-25 10:31:52,522 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3386 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=8059, Invalid=14893, Unknown=0, NotChecked=0, Total=22952 [2024-09-25 10:31:52,523 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:52,523 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-09-25 10:31:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2024-09-25 10:31:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0251572327044025) internal successors, (163), 159 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2024-09-25 10:31:52,537 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 153 [2024-09-25 10:31:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:52,539 INFO L474 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2024-09-25 10:31:52,539 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 2.023529411764706) internal successors, (172), 85 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:52,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2024-09-25 10:31:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-09-25 10:31:52,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:52,541 INFO L216 NwaCegarLoop]: trace histogram [69, 67, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:52,559 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:31:52,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:52,742 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:52,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2078130604, now seen corresponding path program 7 times [2024-09-25 10:31:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928284082] [2024-09-25 10:31:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:55,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4866 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:31:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928284082] [2024-09-25 10:31:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928284082] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255439309] [2024-09-25 10:31:55,373 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:31:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:55,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:55,376 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:31:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:55,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-09-25 10:31:55,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4866 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:31:55,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4866 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:31:59,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255439309] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:59,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2024-09-25 10:31:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130177023] [2024-09-25 10:31:59,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:59,379 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2024-09-25 10:31:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2024-09-25 10:31:59,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2024-09-25 10:31:59,384 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:59,819 INFO L93 Difference]: Finished difference Result 327 states and 402 transitions. [2024-09-25 10:31:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-09-25 10:31:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2024-09-25 10:31:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:59,821 INFO L225 Difference]: With dead ends: 327 [2024-09-25 10:31:59,821 INFO L226 Difference]: Without dead ends: 302 [2024-09-25 10:31:59,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2024-09-25 10:31:59,823 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:59,823 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-09-25 10:31:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-09-25 10:31:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 297 states have (on average 1.0134680134680134) internal successors, (301), 297 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 305 transitions. [2024-09-25 10:31:59,850 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 305 transitions. Word has length 163 [2024-09-25 10:31:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:59,852 INFO L474 AbstractCegarLoop]: Abstraction has 302 states and 305 transitions. [2024-09-25 10:31:59,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 305 transitions. [2024-09-25 10:31:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-09-25 10:31:59,857 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:59,857 INFO L216 NwaCegarLoop]: trace histogram [138, 136, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:59,871 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:32:00,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:00,058 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:00,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 275110883, now seen corresponding path program 8 times [2024-09-25 10:32:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643848699] [2024-09-25 10:32:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:10,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 19149 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:32:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643848699] [2024-09-25 10:32:10,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643848699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:10,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803923513] [2024-09-25 10:32:10,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:32:10,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:10,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:10,361 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:32:10,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:32:10,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:10,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 274 conjuncts are in the unsatisfiable core [2024-09-25 10:32:10,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19149 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:32:10,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19149 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:32:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803923513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:25,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 277 [2024-09-25 10:32:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964264539] [2024-09-25 10:32:25,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:25,377 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 277 states [2024-09-25 10:32:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 277 interpolants. [2024-09-25 10:32:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38226, Invalid=38226, Unknown=0, NotChecked=0, Total=76452 [2024-09-25 10:32:25,386 INFO L87 Difference]: Start difference. First operand 302 states and 305 transitions. Second operand has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:26,533 INFO L93 Difference]: Finished difference Result 603 states and 747 transitions. [2024-09-25 10:32:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2024-09-25 10:32:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 301 [2024-09-25 10:32:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:26,537 INFO L225 Difference]: With dead ends: 603 [2024-09-25 10:32:26,537 INFO L226 Difference]: Without dead ends: 578 [2024-09-25 10:32:26,539 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=38226, Invalid=38226, Unknown=0, NotChecked=0, Total=76452 [2024-09-25 10:32:26,540 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:26,540 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:32:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-09-25 10:32:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2024-09-25 10:32:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 573 states have (on average 1.006980802792321) internal successors, (577), 573 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 581 transitions. [2024-09-25 10:32:26,583 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 581 transitions. Word has length 301 [2024-09-25 10:32:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:26,583 INFO L474 AbstractCegarLoop]: Abstraction has 578 states and 581 transitions. [2024-09-25 10:32:26,584 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:26,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 581 transitions. [2024-09-25 10:32:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2024-09-25 10:32:26,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:26,590 INFO L216 NwaCegarLoop]: trace histogram [276, 274, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:26,603 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:32:26,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:32:26,790 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:26,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1282507457, now seen corresponding path program 9 times [2024-09-25 10:32:26,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:26,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359786463] [2024-09-25 10:32:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:18,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 76281 backedges. 825 proven. 75350 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-09-25 10:33:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359786463] [2024-09-25 10:33:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359786463] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463736067] [2024-09-25 10:33:18,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:33:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:18,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:33:18,602 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:33:18,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 10:33:18,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:18,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:33:18,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 76281 backedges. 1370 proven. 4 refuted. 0 times theorem prover too weak. 74907 trivial. 0 not checked. [2024-09-25 10:33:19,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76281 backedges. 1370 proven. 4 refuted. 0 times theorem prover too weak. 74907 trivial. 0 not checked. [2024-09-25 10:33:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463736067] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:19,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:19,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [277, 5, 5] total 283 [2024-09-25 10:33:19,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032358120] [2024-09-25 10:33:19,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:19,639 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 283 states [2024-09-25 10:33:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 283 interpolants. [2024-09-25 10:33:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39903, Invalid=39903, Unknown=0, NotChecked=0, Total=79806 [2024-09-25 10:33:19,647 INFO L87 Difference]: Start difference. First operand 578 states and 581 transitions. Second operand has 283 states, 283 states have (on average 2.0318021201413425) internal successors, (575), 283 states have internal predecessors, (575), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:20,961 INFO L93 Difference]: Finished difference Result 613 states and 628 transitions. [2024-09-25 10:33:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2024-09-25 10:33:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 283 states, 283 states have (on average 2.0318021201413425) internal successors, (575), 283 states have internal predecessors, (575), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 577 [2024-09-25 10:33:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:20,966 INFO L225 Difference]: With dead ends: 613 [2024-09-25 10:33:20,966 INFO L226 Difference]: Without dead ends: 588 [2024-09-25 10:33:20,969 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1432 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=39903, Invalid=39903, Unknown=0, NotChecked=0, Total=79806 [2024-09-25 10:33:20,970 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:20,970 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:33:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-09-25 10:33:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2024-09-25 10:33:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 583 states have (on average 1.0137221269296741) internal successors, (591), 583 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 595 transitions. [2024-09-25 10:33:21,006 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 595 transitions. Word has length 577 [2024-09-25 10:33:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:21,006 INFO L474 AbstractCegarLoop]: Abstraction has 588 states and 595 transitions. [2024-09-25 10:33:21,007 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 283 states, 283 states have (on average 2.0318021201413425) internal successors, (575), 283 states have internal predecessors, (575), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:21,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 595 transitions. [2024-09-25 10:33:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-09-25 10:33:21,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:21,015 INFO L216 NwaCegarLoop]: trace histogram [281, 275, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:21,030 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 10:33:21,216 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-25 10:33:21,216 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:21,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -121382824, now seen corresponding path program 10 times [2024-09-25 10:33:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505850115] [2024-09-25 10:33:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:15,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 79066 backedges. 3036 proven. 75900 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-09-25 10:34:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505850115] [2024-09-25 10:34:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505850115] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:15,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947642929] [2024-09-25 10:34:15,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:34:15,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:15,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:15,102 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:34:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:34:15,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:34:15,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:34:15,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 552 conjuncts are in the unsatisfiable core [2024-09-25 10:34:15,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 79066 backedges. 3036 proven. 75900 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-09-25 10:34:15,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:35:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 79066 backedges. 3036 proven. 75900 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-09-25 10:35:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947642929] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:35:13,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:35:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [278, 278, 278] total 555 [2024-09-25 10:35:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571657913] [2024-09-25 10:35:13,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:35:13,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 555 states [2024-09-25 10:35:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 555 interpolants. [2024-09-25 10:35:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153735, Invalid=153735, Unknown=0, NotChecked=0, Total=307470 [2024-09-25 10:35:13,380 INFO L87 Difference]: Start difference. First operand 588 states and 595 transitions. Second operand has 555 states, 555 states have (on average 2.0144144144144143) internal successors, (1118), 555 states have internal predecessors, (1118), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:20,511 INFO L93 Difference]: Finished difference Result 1175 states and 1466 transitions. [2024-09-25 10:35:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 554 states. [2024-09-25 10:35:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 555 states, 555 states have (on average 2.0144144144144143) internal successors, (1118), 555 states have internal predecessors, (1118), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 587 [2024-09-25 10:35:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:20,516 INFO L225 Difference]: With dead ends: 1175 [2024-09-25 10:35:20,516 INFO L226 Difference]: Without dead ends: 1142 [2024-09-25 10:35:20,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1453 GetRequests, 900 SyntacticMatches, 0 SemanticMatches, 553 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 75.9s TimeCoverageRelationStatistics Valid=153735, Invalid=153735, Unknown=0, NotChecked=0, Total=307470 [2024-09-25 10:35:20,527 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:20,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-25 10:35:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-09-25 10:35:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2024-09-25 10:35:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1137 states have (on average 1.0070360598065085) internal successors, (1145), 1137 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1149 transitions. [2024-09-25 10:35:20,593 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1149 transitions. Word has length 587 [2024-09-25 10:35:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:20,594 INFO L474 AbstractCegarLoop]: Abstraction has 1142 states and 1149 transitions. [2024-09-25 10:35:20,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 555 states, 555 states have (on average 2.0144144144144143) internal successors, (1118), 555 states have internal predecessors, (1118), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:20,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1149 transitions. [2024-09-25 10:35:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2024-09-25 10:35:20,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:20,602 INFO L216 NwaCegarLoop]: trace histogram [558, 552, 14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:20,619 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-25 10:35:20,802 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:35:20,803 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:20,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 179381079, now seen corresponding path program 11 times [2024-09-25 10:35:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793393999] [2024-09-25 10:35:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat