./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --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 11:29:13,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:29:13,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:29:13,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:29:13,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:29:13,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:29:13,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:29:13,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:29:13,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:29:13,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:29:13,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:29:13,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:29:13,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:29:13,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:29:13,873 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:29:13,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:29:13,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:29:13,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:29:13,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:29:13,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:29:13,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:29:13,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:29:13,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:29:13,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:29:13,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:29:13,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:29:13,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:29:13,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:29:13,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:29:13,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:29:13,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:29:13,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:29:13,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:13,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:29:13,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:29:13,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:29:13,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:29:13,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:29:13,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:29:13,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:29:13,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:29:13,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:29:13,891 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 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 11:29:14,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:29:14,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:29:14,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:29:14,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:29:14,210 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:29:14,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-25 11:29:15,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:29:15,880 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:29:15,881 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-25 11:29:15,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0b249386f/c02d90a9b145490088f91e2bc07ae75c/FLAGd1fb0a50a [2024-09-25 11:29:16,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0b249386f/c02d90a9b145490088f91e2bc07ae75c [2024-09-25 11:29:16,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:29:16,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:29:16,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:16,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:29:16,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:29:16,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61524bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16, skipping insertion in model container [2024-09-25 11:29:16,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:29:16,468 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-25 11:29:16,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:16,508 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:29:16,525 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-25 11:29:16,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:16,557 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:29:16,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16 WrapperNode [2024-09-25 11:29:16,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:16,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:16,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:29:16,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:29:16,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,583 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:29:16,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:16,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:29:16,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:29:16,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:29:16,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,619 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-25 11:29:16,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:29:16,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:29:16,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:29:16,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:29:16,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (1/1) ... [2024-09-25 11:29:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:16,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:16,678 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 11:29:16,682 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 11:29:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:29:16,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:29:16,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 11:29:16,729 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 11:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:29:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 11:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:29:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:29:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:29:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:29:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 11:29:16,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 11:29:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:29:16,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:29:16,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:29:16,834 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:29:16,836 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:29:17,020 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-25 11:29:17,021 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:29:17,049 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:29:17,050 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:29:17,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:17 BoogieIcfgContainer [2024-09-25 11:29:17,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:29:17,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:29:17,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:29:17,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:29:17,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:29:16" (1/3) ... [2024-09-25 11:29:17,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d66bbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:17, skipping insertion in model container [2024-09-25 11:29:17,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:16" (2/3) ... [2024-09-25 11:29:17,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d66bbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:17, skipping insertion in model container [2024-09-25 11:29:17,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:17" (3/3) ... [2024-09-25 11:29:17,062 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-25 11:29:17,078 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:29:17,078 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:29:17,128 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:29:17,135 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;@34726d01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:29:17,135 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:29:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 11:29:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:29:17,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:17,151 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:17,151 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:17,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-25 11:29:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960910187] [2024-09-25 11:29:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960910187] [2024-09-25 11:29:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960910187] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:17,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 11:29:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391910128] [2024-09-25 11:29:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:17,393 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 11:29:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 11:29:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:29:17,424 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:29:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:17,564 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-25 11:29:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 11:29:17,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-25 11:29:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:17,572 INFO L225 Difference]: With dead ends: 78 [2024-09-25 11:29:17,572 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 11:29:17,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 11:29:17,578 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:17,578 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:29:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 11:29:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 11:29:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 11:29:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 11:29:17,610 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-25 11:29:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:17,610 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 11:29:17,610 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:29:17,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 11:29:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:29:17,613 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:17,613 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:17,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:29:17,613 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:17,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-25 11:29:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952971734] [2024-09-25 11:29:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952971734] [2024-09-25 11:29:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952971734] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 11:29:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419209762] [2024-09-25 11:29:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:17,987 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:29:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:29:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:29:17,989 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:29:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:18,296 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-09-25 11:29:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:29:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-25 11:29:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:18,299 INFO L225 Difference]: With dead ends: 62 [2024-09-25 11:29:18,299 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 11:29:18,299 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:29:18,302 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:18,302 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:29:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 11:29:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-25 11:29:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 11:29:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-25 11:29:18,322 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-09-25 11:29:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:18,322 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-25 11:29:18,323 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:29:18,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-25 11:29:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 11:29:18,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:18,324 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:18,324 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:29:18,324 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:18,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-25 11:29:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44281177] [2024-09-25 11:29:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 11:29:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:18,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44281177] [2024-09-25 11:29:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44281177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:18,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 11:29:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831734199] [2024-09-25 11:29:18,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:18,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 11:29:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 11:29:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:29:18,617 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:29:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:18,858 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-25 11:29:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:29:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-09-25 11:29:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:18,862 INFO L225 Difference]: With dead ends: 61 [2024-09-25 11:29:18,862 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 11:29:18,862 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:29:18,863 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:18,863 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:29:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 11:29:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-25 11:29:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 11:29:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-25 11:29:18,883 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-09-25 11:29:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:18,883 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-25 11:29:18,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:29:18,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-25 11:29:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:29:18,888 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:18,888 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-09-25 11:29:18,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:29:18,888 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:18,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-09-25 11:29:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568613210] [2024-09-25 11:29:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 11:29:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:29:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:29:19,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568613210] [2024-09-25 11:29:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568613210] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732949378] [2024-09-25 11:29:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:19,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:19,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:19,227 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 11:29:19,229 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 11:29:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:19,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 11:29:19,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:29:19,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732949378] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:19,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:29:19,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-25 11:29:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562672826] [2024-09-25 11:29:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:19,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:29:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:19,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:29:19,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:29:19,485 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:29:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:19,693 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-09-25 11:29:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:29:19,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-25 11:29:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:19,695 INFO L225 Difference]: With dead ends: 68 [2024-09-25 11:29:19,697 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 11:29:19,697 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:29:19,698 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:19,699 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:29:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 11:29:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-09-25 11:29:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:29:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-25 11:29:19,718 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-09-25 11:29:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:19,719 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-25 11:29:19,719 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:29:19,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-25 11:29:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 11:29:19,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:19,723 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:29:19,741 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 11:29:19,924 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:19,925 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:19,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-25 11:29:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430692097] [2024-09-25 11:29:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 11:29:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:29:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:29:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:29:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430692097] [2024-09-25 11:29:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430692097] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716117917] [2024-09-25 11:29:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:20,112 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 11:29:20,114 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 11:29:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 11:29:20,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:20,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 11:29:20,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-25 11:29:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:20,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716117917] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:20,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:29:20,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-09-25 11:29:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855811647] [2024-09-25 11:29:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:20,368 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 11:29:20,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 11:29:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:29:20,369 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:29:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:20,500 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-09-25 11:29:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:29:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-25 11:29:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:20,501 INFO L225 Difference]: With dead ends: 72 [2024-09-25 11:29:20,501 INFO L226 Difference]: Without dead ends: 46 [2024-09-25 11:29:20,502 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:29:20,503 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:20,503 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:29:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-25 11:29:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-25 11:29:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:29:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-25 11:29:20,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-09-25 11:29:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:20,519 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-25 11:29:20,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:29:20,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-25 11:29:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 11:29:20,521 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:20,523 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:29:20,540 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 11:29:20,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:20,725 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:20,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-09-25 11:29:20,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095411183] [2024-09-25 11:29:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:29:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 11:29:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:29:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:29:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:29:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095411183] [2024-09-25 11:29:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095411183] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098473243] [2024-09-25 11:29:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:20,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:20,966 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 11:29:20,968 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 11:29:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:21,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-25 11:29:21,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:21,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 11:29:21,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-25 11:29:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:29:21,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:29,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098473243] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:29,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:29:29,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-25 11:29:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871859679] [2024-09-25 11:29:29,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:29,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 11:29:29,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:29,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 11:29:29,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:29:29,479 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 11:29:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:30,032 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-25 11:29:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:29:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 46 [2024-09-25 11:29:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:30,034 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:29:30,034 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:29:30,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 11:29:30,035 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:30,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:29:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:29:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:29:30,039 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 11:29:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:29:30,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-25 11:29:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:30,039 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:29:30,039 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 11:29:30,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:29:30,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:29:30,042 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:29:30,062 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 11:29:30,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 11:29:30,249 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-25 11:29:30,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:29:31,575 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:29:31,589 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:29:31,589 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:29:31,590 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:31,590 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:31,590 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:31,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:31,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:29:31,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:29:31,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:29:31,591 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:29:31,592 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-09-25 11:29:31,592 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:31,592 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:31,593 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:31,593 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:31,596 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-25 11:29:31,601 INFO L158 Benchmark]: Toolchain (without parser) took 15318.35ms. Allocated memory was 60.8MB in the beginning and 113.2MB in the end (delta: 52.4MB). Free memory was 25.1MB in the beginning and 50.1MB in the end (delta: -25.0MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-09-25 11:29:31,601 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 46.1MB. Free memory was 31.3MB in the beginning and 31.3MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:29:31,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.88ms. Allocated memory is still 60.8MB. Free memory was 24.9MB in the beginning and 31.0MB in the end (delta: -6.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-09-25 11:29:31,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.83ms. Allocated memory is still 60.8MB. Free memory was 31.0MB in the beginning and 30.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:29:31,602 INFO L158 Benchmark]: Boogie Preprocessor took 51.21ms. Allocated memory is still 60.8MB. Free memory was 30.0MB in the beginning and 27.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:29:31,602 INFO L158 Benchmark]: RCFGBuilder took 410.96ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 46.5MB in the end (delta: -18.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-09-25 11:29:31,603 INFO L158 Benchmark]: TraceAbstraction took 14545.41ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 46.1MB in the beginning and 50.1MB in the end (delta: -4.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-09-25 11:29:31,604 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.21ms. Allocated memory is still 46.1MB. Free memory was 31.3MB in the beginning and 31.3MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.88ms. Allocated memory is still 60.8MB. Free memory was 24.9MB in the beginning and 31.0MB in the end (delta: -6.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.83ms. Allocated memory is still 60.8MB. Free memory was 31.0MB in the beginning and 30.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.21ms. Allocated memory is still 60.8MB. Free memory was 30.0MB in the beginning and 27.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.96ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 46.5MB in the end (delta: -18.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14545.41ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 46.1MB in the beginning and 50.1MB in the end (delta: -4.0MB). Peak memory consumption was 58.7MB. 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: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - 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 * 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: 11]: 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 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 124 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 348 ConstructedInterpolants, 22 QuantifiedInterpolants, 1064 SizeOfPredicates, 21 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 93/110 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 - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-25 11:29:31,642 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --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 11:29:33,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:29:33,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-25 11:29:33,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:29:33,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:29:33,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:29:33,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:29:33,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:29:33,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:29:33,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:29:33,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:29:33,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:29:33,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:29:33,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:29:33,711 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:29:33,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:29:33,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:29:33,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:29:33,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:29:33,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:29:33,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:29:33,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:29:33,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:29:33,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-25 11:29:33,715 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-25 11:29:33,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:29:33,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-25 11:29:33,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:29:33,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:29:33,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:29:33,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:29:33,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:29:33,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:29:33,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:29:33,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:33,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:29:33,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:29:33,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:29:33,721 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-25 11:29:33,721 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-25 11:29:33,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:29:33,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:29:33,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:29:33,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:29:33,722 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-25 11:29:33,723 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 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 11:29:34,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:29:34,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:29:34,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:29:34,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:29:34,061 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:29:34,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-25 11:29:35,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:29:35,718 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:29:35,719 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-25 11:29:35,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0cb4ad1e6/a80386dad2434a1d9827b57c6c63af5a/FLAG09cf587c4 [2024-09-25 11:29:35,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0cb4ad1e6/a80386dad2434a1d9827b57c6c63af5a [2024-09-25 11:29:35,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:29:35,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:29:35,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:35,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:29:35,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:29:35,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:35" (1/1) ... [2024-09-25 11:29:35,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9076f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:35, skipping insertion in model container [2024-09-25 11:29:35,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:35" (1/1) ... [2024-09-25 11:29:35,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:29:35,943 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-25 11:29:35,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:35,995 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:29:36,007 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/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-25 11:29:36,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:36,033 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:29:36,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36 WrapperNode [2024-09-25 11:29:36,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:36,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:36,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:29:36,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:29:36,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,060 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:29:36,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:36,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:29:36,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:29:36,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:29:36,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,090 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-25 11:29:36,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:29:36,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:29:36,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:29:36,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:29:36,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (1/1) ... [2024-09-25 11:29:36,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:36,154 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 11:29:36,157 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 11:29:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:29:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-25 11:29:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-25 11:29:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:29:36,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:29:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:29:36,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:29:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 11:29:36,212 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 11:29:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:29:36,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:29:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 11:29:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-25 11:29:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-25 11:29:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:29:36,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:29:36,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 11:29:36,215 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 11:29:36,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:29:36,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:29:36,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:29:36,340 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:29:36,343 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:29:36,583 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-25 11:29:36,583 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:29:36,611 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:29:36,612 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:29:36,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:36 BoogieIcfgContainer [2024-09-25 11:29:36,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:29:36,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:29:36,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:29:36,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:29:36,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:29:35" (1/3) ... [2024-09-25 11:29:36,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:36, skipping insertion in model container [2024-09-25 11:29:36,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:36" (2/3) ... [2024-09-25 11:29:36,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:36, skipping insertion in model container [2024-09-25 11:29:36,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:36" (3/3) ... [2024-09-25 11:29:36,622 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-25 11:29:36,640 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:29:36,641 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:29:36,701 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:29:36,709 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;@270267b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:29:36,709 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:29:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 11:29:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:29:36,721 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:36,722 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:36,723 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:36,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-25 11:29:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:36,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183745689] [2024-09-25 11:29:36,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:36,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:36,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:36,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:29:36,748 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-25 11:29:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:36,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-25 11:29:36,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:29:36,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:36,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183745689] [2024-09-25 11:29:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183745689] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:29:36,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962892778] [2024-09-25 11:29:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:36,901 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:29:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:36,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:29:36,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:29:36,930 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:29:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:36,970 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-25 11:29:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:29:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-25 11:29:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:36,982 INFO L225 Difference]: With dead ends: 78 [2024-09-25 11:29:36,982 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 11:29:36,987 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:29:36,992 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:36,995 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:29:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 11:29:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 11:29:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 11:29:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-25 11:29:37,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-25 11:29:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:37,038 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-25 11:29:37,038 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:29:37,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-25 11:29:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:29:37,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:37,042 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:37,047 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-09-25 11:29:37,245 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:37,246 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:37,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-25 11:29:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123748683] [2024-09-25 11:29:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:37,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:29:37,255 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-25 11:29:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:37,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 11:29:37,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:37,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:37,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123748683] [2024-09-25 11:29:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123748683] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:37,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-25 11:29:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770361539] [2024-09-25 11:29:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:37,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:29:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:29:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:29:37,790 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:29:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:38,164 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-25 11:29:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 11:29:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-25 11:29:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:38,166 INFO L225 Difference]: With dead ends: 56 [2024-09-25 11:29:38,166 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 11:29:38,167 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:29:38,168 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:38,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:29:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 11:29:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-25 11:29:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 11:29:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-25 11:29:38,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-09-25 11:29:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:38,185 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-25 11:29:38,186 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:29:38,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-25 11:29:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 11:29:38,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:38,187 INFO L216 NwaCegarLoop]: trace histogram [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 11:29:38,191 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:29:38,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:38,391 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:38,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-25 11:29:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273528022] [2024-09-25 11:29:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:38,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:29:38,405 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-25 11:29:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:38,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 11:29:38,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:38,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 11:29:38,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:29:38,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-09-25 11:29:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:29:38,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:38,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273528022] [2024-09-25 11:29:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273528022] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-25 11:29:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091848431] [2024-09-25 11:29:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:38,837 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 11:29:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:38,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 11:29:38,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:29:38,839 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:29:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:39,167 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-25 11:29:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:29:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-09-25 11:29:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:39,171 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:29:39,172 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 11:29:39,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-09-25 11:29:39,174 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:39,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 285 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:29:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 11:29:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-25 11:29:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 11:29:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-25 11:29:39,192 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-09-25 11:29:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:39,193 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-25 11:29:39,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:29:39,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-25 11:29:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:29:39,194 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:39,194 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-09-25 11:29:39,198 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:29:39,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:39,397 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:39,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-09-25 11:29:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167532894] [2024-09-25 11:29:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:39,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:29:39,401 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-25 11:29:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:39,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 11:29:39,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:29:40,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:29:40,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167532894] [2024-09-25 11:29:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167532894] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:29:40,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:29:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-09-25 11:29:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605715326] [2024-09-25 11:29:40,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:40,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 11:29:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:40,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 11:29:40,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:29:40,637 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 11:29:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:42,440 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-25 11:29:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-25 11:29:42,441 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-25 11:29:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:42,443 INFO L225 Difference]: With dead ends: 108 [2024-09-25 11:29:42,443 INFO L226 Difference]: Without dead ends: 106 [2024-09-25 11:29:42,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 11:29:42,445 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:42,445 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-25 11:29:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-25 11:29:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-09-25 11:29:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 11:29:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-09-25 11:29:42,473 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-09-25 11:29:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:42,475 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-09-25 11:29:42,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 11:29:42,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-09-25 11:29:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 11:29:42,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:42,477 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:29:42,482 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-09-25 11:29:42,680 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:42,680 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:42,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-25 11:29:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193816602] [2024-09-25 11:29:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:42,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:29:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:42,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:29:42,684 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-25 11:29:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:42,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 11:29:42,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:43,780 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-09-25 11:29:43,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 71 [2024-09-25 11:29:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:29:44,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:53,469 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-09-25 11:29:53,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-09-25 11:29:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:29:54,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193816602] [2024-09-25 11:29:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193816602] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:29:54,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:29:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-09-25 11:29:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010927388] [2024-09-25 11:29:54,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:54,727 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-25 11:29:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-25 11:29:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=952, Unknown=2, NotChecked=0, Total=1056 [2024-09-25 11:29:54,729 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 11:30:01,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 11:30:06,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-25 11:30:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:08,157 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-09-25 11:30:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-25 11:30:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 46 [2024-09-25 11:30:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:08,161 INFO L225 Difference]: With dead ends: 165 [2024-09-25 11:30:08,161 INFO L226 Difference]: Without dead ends: 163 [2024-09-25 11:30:08,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=258, Invalid=2496, Unknown=2, NotChecked=0, Total=2756 [2024-09-25 11:30:08,166 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:08,166 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 673 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-09-25 11:30:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-25 11:30:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-09-25 11:30:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 93 states have internal predecessors, (98), 40 states have call successors, (40), 18 states have call predecessors, (40), 20 states have return successors, (42), 34 states have call predecessors, (42), 37 states have call successors, (42) [2024-09-25 11:30:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-25 11:30:08,224 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-09-25 11:30:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:08,224 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-25 11:30:08,225 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 11:30:08,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-25 11:30:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 11:30:08,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:08,227 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:08,231 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-09-25 11:30:08,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:30:08,428 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:08,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-09-25 11:30:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:30:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059807443] [2024-09-25 11:30:08,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:08,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:30:08,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:30:08,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 11:30:08,431 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-25 11:30:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:08,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 11:30:08,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:08,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:30:08,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-25 11:30:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 11:30:09,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:10,164 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-09-25 11:30:10,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-09-25 11:30:11,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:30:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059807443] [2024-09-25 11:30:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059807443] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1944275354] [2024-09-25 11:30:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-25 11:30:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-25 11:30:11,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-25 11:30:11,168 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-09-25 11:30:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:11,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 11:30:11,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:11,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 11:30:15,641 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-09-25 11:31:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 1 refuted. 2 times theorem prover too weak. 4 trivial. 5 not checked. [2024-09-25 11:31:34,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:32:02,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1944275354] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:32:02,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:32:02,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-09-25 11:32:02,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116766448] [2024-09-25 11:32:02,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:32:02,689 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:32:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:32:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:32:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=774, Unknown=22, NotChecked=56, Total=930 [2024-09-25 11:32:02,690 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 24 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 9 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-25 11:32:11,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:15,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:19,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:35,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:39,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:43,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:47,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:51,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:32:55,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:33:08,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:33:12,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:33:16,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:33:20,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:33:29,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]