./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound100.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/nla-digbench-scaling/cohendiv-ll_unwindbound100.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 7cdbf1a1c8f20bea42ab4ad35fbada62352deeb8460cfeb3778e870071fb234e --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:43:52,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:43:52,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:43:52,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:43:52,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:43:52,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:43:52,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:43:52,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:43:52,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:43:52,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:43:52,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:43:52,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:43:52,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:43:52,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:43:52,877 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:43:52,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:43:52,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:43:52,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:43:52,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:43:52,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:43:52,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:43:52,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:43:52,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:43:52,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:43:52,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:43:52,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:43:52,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:43:52,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:52,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:43:52,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:43:52,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:43:52,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:43:52,884 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 -> 7cdbf1a1c8f20bea42ab4ad35fbada62352deeb8460cfeb3778e870071fb234e 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:43:53,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:43:53,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:43:53,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:43:53,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:43:53,149 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:43:53,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2024-09-25 10:43:54,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:43:54,561 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:43:54,562 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound100.c [2024-09-25 10:43:54,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/eeb10ab5a/bc029fdda92a42369d65bd5733e7a2e4/FLAGcd6c5d3c4 [2024-09-25 10:43:54,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/eeb10ab5a/bc029fdda92a42369d65bd5733e7a2e4 [2024-09-25 10:43:54,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:43:54,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:43:54,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:54,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:43:54,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:43:54,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac4ea92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54, skipping insertion in model container [2024-09-25 10:43:54,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:43:54,724 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/nla-digbench-scaling/cohendiv-ll_unwindbound100.c[576,589] [2024-09-25 10:43:54,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:54,750 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:43:54,765 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/nla-digbench-scaling/cohendiv-ll_unwindbound100.c[576,589] [2024-09-25 10:43:54,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:43:54,785 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:43:54,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54 WrapperNode [2024-09-25 10:43:54,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:43:54,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:54,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:43:54,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:43:54,793 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:43:54" (1/1) ... [2024-09-25 10:43:54,797 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:43:54" (1/1) ... [2024-09-25 10:43:54,801 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:43:54,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:43:54,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:43:54,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:43:54,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:43:54,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,828 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:43:54,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:43:54,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:43:54,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:43:54,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:43:54,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (1/1) ... [2024-09-25 10:43:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:43:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:54,860 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:43:54,861 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:43:54,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:43:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:43:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:43:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:43:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:43:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:43:54,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:43:54,945 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:43:54,947 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:43:55,084 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:43:55,085 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:43:55,107 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:43:55,108 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:43:55,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:55 BoogieIcfgContainer [2024-09-25 10:43:55,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:43:55,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:43:55,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:43:55,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:43:55,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:43:54" (1/3) ... [2024-09-25 10:43:55,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f31e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:55, skipping insertion in model container [2024-09-25 10:43:55,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:43:54" (2/3) ... [2024-09-25 10:43:55,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f31e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:43:55, skipping insertion in model container [2024-09-25 10:43:55,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:55" (3/3) ... [2024-09-25 10:43:55,116 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound100.c [2024-09-25 10:43:55,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:43:55,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:43:55,177 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:43:55,182 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;@4ae5f5ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:43:55,183 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:43:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:43:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:43:55,192 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,192 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,193 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -166019731, now seen corresponding path program 1 times [2024-09-25 10:43:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460503215] [2024-09-25 10:43:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,323 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:43:55,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460503215] [2024-09-25 10:43:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460503215] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:43:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620351122] [2024-09-25 10:43:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:43:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:43:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:43:55,344 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:55,428 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-09-25 10:43:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:43:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:43:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:55,435 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:43:55,435 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:43:55,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:43:55,440 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:43:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-25 10:43:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:43:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-25 10:43:55,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2024-09-25 10:43:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,479 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-25 10:43:55,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:55,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-25 10:43:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:43:55,481 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,482 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:43:55,482 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1899526296, now seen corresponding path program 1 times [2024-09-25 10:43:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608701610] [2024-09-25 10:43:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,639 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:43:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608701610] [2024-09-25 10:43:55,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608701610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877288936] [2024-09-25 10:43:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:55,649 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:43:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:55,795 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-25 10:43:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:43:55,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-25 10:43:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:55,797 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:43:55,797 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 10:43:55,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:55,799 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:55,799 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 10:43:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 10:43:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 10:43:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-25 10:43:55,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2024-09-25 10:43:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:55,816 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-25 10:43:55,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:43:55,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-25 10:43:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:43:55,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:55,819 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:55,819 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:43:55,819 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:55,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1901015846, now seen corresponding path program 1 times [2024-09-25 10:43:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258559380] [2024-09-25 10:43:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908055049] [2024-09-25 10:43:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:55,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:55,845 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:43:55,848 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:43:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:55,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:55,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:55,954 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:43:55,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:55,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:55,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258559380] [2024-09-25 10:43:55,956 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908055049] [2024-09-25 10:43:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908055049] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:55,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:55,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:55,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142148348] [2024-09-25 10:43:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:55,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:55,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:55,958 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:56,026 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 10:43:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-25 10:43:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:56,028 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:43:56,028 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 10:43:56,028 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:56,029 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:56,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 10:43:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-25 10:43:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:43:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-25 10:43:56,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2024-09-25 10:43:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:56,045 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-25 10:43:56,045 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:43:56,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-25 10:43:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:43:56,045 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:56,045 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:56,060 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:43:56,249 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,254 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:56,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1706287866, now seen corresponding path program 1 times [2024-09-25 10:43:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:56,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181384623] [2024-09-25 10:43:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777896164] [2024-09-25 10:43:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:56,273 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:43:56,274 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:43:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:56,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:43:56,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181384623] [2024-09-25 10:43:56,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777896164] [2024-09-25 10:43:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777896164] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465437827] [2024-09-25 10:43:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:56,346 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:56,347 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:56,413 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-25 10:43:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:43:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:56,414 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:43:56,416 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 10:43:56,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:56,417 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:56,417 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 10:43:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-25 10:43:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:43:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-09-25 10:43:56,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2024-09-25 10:43:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:56,435 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-09-25 10:43:56,435 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:43:56,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-09-25 10:43:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:43:56,439 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:56,439 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:56,453 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:43:56,640 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,640 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:56,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1856957465, now seen corresponding path program 1 times [2024-09-25 10:43:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833700746] [2024-09-25 10:43:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969923600] [2024-09-25 10:43:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:56,664 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:43:56,665 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:43:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:56,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:43:56,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:43:56,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833700746] [2024-09-25 10:43:56,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969923600] [2024-09-25 10:43:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969923600] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:43:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023178640] [2024-09-25 10:43:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:56,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:43:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:43:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:43:56,747 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 10:43:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:56,809 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-09-25 10:43:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-25 10:43:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:56,811 INFO L225 Difference]: With dead ends: 82 [2024-09-25 10:43:56,813 INFO L226 Difference]: Without dead ends: 80 [2024-09-25 10:43:56,813 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:43:56,814 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:56,814 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-25 10:43:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-09-25 10:43:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-09-25 10:43:56,836 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 30 [2024-09-25 10:43:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:56,836 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-09-25 10:43:56,836 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 10:43:56,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-09-25 10:43:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 10:43:56,838 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:56,838 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:56,851 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:43:57,039 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:57,039 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:57,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1900127414, now seen corresponding path program 1 times [2024-09-25 10:43:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904609533] [2024-09-25 10:43:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,151 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:43:57,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904609533] [2024-09-25 10:43:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904609533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:43:57,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952501859] [2024-09-25 10:43:57,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:57,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:43:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:57,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:43:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:43:57,181 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:43:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:57,277 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2024-09-25 10:43:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:43:57,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-09-25 10:43:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:57,279 INFO L225 Difference]: With dead ends: 112 [2024-09-25 10:43:57,279 INFO L226 Difference]: Without dead ends: 77 [2024-09-25 10:43:57,280 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:43:57,280 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:57,281 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-25 10:43:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-25 10:43:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-09-25 10:43:57,297 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 33 [2024-09-25 10:43:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:57,297 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-09-25 10:43:57,297 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:43:57,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-09-25 10:43:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:43:57,299 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:57,299 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:57,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:43:57,299 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:57,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680743, now seen corresponding path program 1 times [2024-09-25 10:43:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078236856] [2024-09-25 10:43:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:43:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078236856] [2024-09-25 10:43:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078236856] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:43:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:43:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893840594] [2024-09-25 10:43:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:57,465 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:43:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:43:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:43:57,466 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:43:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:57,627 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-25 10:43:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:43:57,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-25 10:43:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:57,631 INFO L225 Difference]: With dead ends: 83 [2024-09-25 10:43:57,631 INFO L226 Difference]: Without dead ends: 81 [2024-09-25 10:43:57,632 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:43:57,632 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:57,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-25 10:43:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-25 10:43:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:43:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-25 10:43:57,646 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 40 [2024-09-25 10:43:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:57,646 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-25 10:43:57,646 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 10:43:57,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-25 10:43:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:43:57,647 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:57,648 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:57,648 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:43:57,648 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:57,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -930915559, now seen corresponding path program 1 times [2024-09-25 10:43:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512973782] [2024-09-25 10:43:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:43:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:43:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512973782] [2024-09-25 10:43:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512973782] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747132918] [2024-09-25 10:43:57,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:57,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:57,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:57,793 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:43:57,794 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:43:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:57,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:43:57,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:57,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:43:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747132918] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:43:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:43:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-25 10:43:57,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946541498] [2024-09-25 10:43:57,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:57,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:43:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:43:57,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:43:57,919 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:43:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:57,992 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-09-25 10:43:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:43:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-09-25 10:43:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:57,993 INFO L225 Difference]: With dead ends: 94 [2024-09-25 10:43:57,994 INFO L226 Difference]: Without dead ends: 92 [2024-09-25 10:43:57,994 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:43:57,994 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:57,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:43:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-25 10:43:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-09-25 10:43:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 10:43:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-25 10:43:58,006 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 46 [2024-09-25 10:43:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:58,006 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-25 10:43:58,006 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 10:43:58,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-25 10:43:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 10:43:58,007 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:58,017 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:58,030 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:43:58,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:58,217 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:58,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -872582608, now seen corresponding path program 1 times [2024-09-25 10:43:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349750323] [2024-09-25 10:43:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:43:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:43:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:43:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:43:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:43:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:43:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:43:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:58,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349750323] [2024-09-25 10:43:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349750323] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969134105] [2024-09-25 10:43:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:58,332 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:43:58,333 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:43:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:58,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:43:58,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 10:43:58,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 10:43:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969134105] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:43:58,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:43:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-09-25 10:43:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661504993] [2024-09-25 10:43:58,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:43:58,543 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:43:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:43:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:43:58,544 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:43:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:58,852 INFO L93 Difference]: Finished difference Result 254 states and 311 transitions. [2024-09-25 10:43:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:43:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 49 [2024-09-25 10:43:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:58,854 INFO L225 Difference]: With dead ends: 254 [2024-09-25 10:43:58,854 INFO L226 Difference]: Without dead ends: 247 [2024-09-25 10:43:58,855 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:43:58,855 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 109 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:58,855 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 148 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:43:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-09-25 10:43:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2024-09-25 10:43:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 155 states have internal predecessors, (175), 58 states have call successors, (58), 27 states have call predecessors, (58), 26 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-25 10:43:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2024-09-25 10:43:58,900 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 49 [2024-09-25 10:43:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:58,901 INFO L474 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2024-09-25 10:43:58,901 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 9 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2024-09-25 10:43:58,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2024-09-25 10:43:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:43:58,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:58,904 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:58,918 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:43:59,105 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:59,105 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:59,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash 260253794, now seen corresponding path program 1 times [2024-09-25 10:43:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:59,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889811849] [2024-09-25 10:43:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:43:59,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030467514] [2024-09-25 10:43:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:59,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:43:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:43:59,117 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:43:59,118 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:43:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:43:59,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-25 10:43:59,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:43:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:43:59,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:43:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 10:43:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:43:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889811849] [2024-09-25 10:43:59,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:43:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030467514] [2024-09-25 10:43:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030467514] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:43:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:43:59,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-09-25 10:43:59,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967356889] [2024-09-25 10:43:59,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:43:59,623 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:43:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:43:59,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:43:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:43:59,624 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:43:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:43:59,744 INFO L93 Difference]: Finished difference Result 249 states and 303 transitions. [2024-09-25 10:43:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:43:59,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2024-09-25 10:43:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:43:59,746 INFO L225 Difference]: With dead ends: 249 [2024-09-25 10:43:59,746 INFO L226 Difference]: Without dead ends: 243 [2024-09-25 10:43:59,747 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:43:59,751 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:43:59,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:43:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-09-25 10:43:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 178. [2024-09-25 10:43:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.131578947368421) internal successors, (129), 119 states have internal predecessors, (129), 39 states have call successors, (39), 25 states have call predecessors, (39), 24 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-25 10:43:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2024-09-25 10:43:59,783 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 54 [2024-09-25 10:43:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:43:59,784 INFO L474 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2024-09-25 10:43:59,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 10:43:59,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2024-09-25 10:43:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-25 10:43:59,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:43:59,785 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:43:59,797 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:43:59,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:43:59,986 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:43:59,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:43:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1070557628, now seen corresponding path program 1 times [2024-09-25 10:43:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:43:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584495114] [2024-09-25 10:43:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:43:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:43:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:44:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:44:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:44:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:44:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 10:44:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 10:44:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 10:44:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-25 10:44:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:44:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:44:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-25 10:44:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:44:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584495114] [2024-09-25 10:44:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584495114] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:44:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418024227] [2024-09-25 10:44:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:44:00,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:44:00,113 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:44:00,117 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:44:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:44:00,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:44:00,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:44:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:00,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:44:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-09-25 10:44:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418024227] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:44:00,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:44:00,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-09-25 10:44:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938292996] [2024-09-25 10:44:00,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:44:00,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:44:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:44:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:44:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:44:00,279 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:44:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:44:00,463 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2024-09-25 10:44:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:44:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 70 [2024-09-25 10:44:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:44:00,465 INFO L225 Difference]: With dead ends: 190 [2024-09-25 10:44:00,465 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:44:00,467 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:44:00,468 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:44:00,468 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:44:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:44:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:44:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:44:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:44:00,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-25 10:44:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:44:00,469 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:44:00,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 10:44:00,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:44:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:44:00,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:44:00,473 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:44:00,486 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:44:00,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:44:00,676 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:44:00,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:44:02,056 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:44:02,069 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,070 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,070 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,070 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,070 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,071 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,071 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,071 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,072 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 10:44:02,072 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,072 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,072 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,072 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,073 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,074 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:44:02,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:44:02 BoogieIcfgContainer [2024-09-25 10:44:02,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:44:02,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:44:02,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:44:02,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:44:02,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:43:55" (3/4) ... [2024-09-25 10:44:02,077 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:44:02,125 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:44:02,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:44:02,126 INFO L158 Benchmark]: Toolchain (without parser) took 7537.76ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 43.8MB in the beginning and 42.8MB in the end (delta: 968.8kB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,126 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 29.5MB in the beginning and 29.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:02,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.71ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 31.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.42ms. Allocated memory is still 62.9MB. Free memory was 31.8MB in the beginning and 30.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:44:02,127 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 62.9MB. Free memory was 30.8MB in the beginning and 29.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,127 INFO L158 Benchmark]: RCFGBuilder took 274.16ms. Allocated memory is still 62.9MB. Free memory was 29.0MB in the beginning and 35.5MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,127 INFO L158 Benchmark]: TraceAbstraction took 6964.27ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 34.9MB in the beginning and 44.9MB in the end (delta: -10.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,128 INFO L158 Benchmark]: Witness Printer took 50.77ms. Allocated memory is still 134.2MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:44:02,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 29.5MB in the beginning and 29.4MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.71ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 31.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.42ms. Allocated memory is still 62.9MB. Free memory was 31.8MB in the beginning and 30.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 62.9MB. Free memory was 30.8MB in the beginning and 29.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.16ms. Allocated memory is still 62.9MB. Free memory was 29.0MB in the beginning and 35.5MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6964.27ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 34.9MB in the beginning and 44.9MB in the end (delta: -10.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 50.77ms. Allocated memory is still 134.2MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 1280 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 949 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 331 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=9, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741 SizeOfPredicates, 14 NumberOfNonLiveVariables, 817 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 905/967 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((1 <= r) && (((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x))) && (\old(counter) == 0)) && (1 <= y)) && (b == ((__int128) a * y))) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((__int128) q * y) + r) + ((__int128) a * y)) == ((__int128) b + x)) && (\old(counter) == 0)) && (1 <= y)) && (b == ((__int128) a * y))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == \old(counter))) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: ((cond != 0) && (counter == \old(counter))) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:44:02,149 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE