./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:51:14,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:51:14,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:51:14,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:51:14,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:51:14,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:51:14,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:51:14,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:51:14,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:51:14,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:51:14,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:51:14,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:51:14,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:51:14,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:51:14,292 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:51:14,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:51:14,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:51:14,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:51:14,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:51:14,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:51:14,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:51:14,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:51:14,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:51:14,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:51:14,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:51:14,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:51:14,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:51:14,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:51:14,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:51:14,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:51:14,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:51:14,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:51:14,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:51:14,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:51:14,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:51:14,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:51:14,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:51:14,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:51:14,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:51:14,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:51:14,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:51:14,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:51:14,302 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:51:14,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:51:14,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:51:14,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:51:14,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:51:14,518 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:51:14,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-18 15:51:15,815 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:51:15,958 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:51:15,958 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-18 15:51:15,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6d3173932/2a399d2a4a784d7db18964c4e00243a8/FLAGe5c1a5219 [2024-09-18 15:51:16,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6d3173932/2a399d2a4a784d7db18964c4e00243a8 [2024-09-18 15:51:16,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:51:16,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:51:16,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:51:16,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:51:16,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:51:16,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2a2000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16, skipping insertion in model container [2024-09-18 15:51:16,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:51:16,510 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/lcp.c[515,528] [2024-09-18 15:51:16,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:51:16,540 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:51:16,549 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/lcp.c[515,528] [2024-09-18 15:51:16,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:51:16,568 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:51:16,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16 WrapperNode [2024-09-18 15:51:16,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:51:16,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:51:16,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:51:16,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:51:16,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,589 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:51:16,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:51:16,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:51:16,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:51:16,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:51:16,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,624 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-09-18 15:51:16,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:51:16,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:51:16,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:51:16,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:51:16,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (1/1) ... [2024-09-18 15:51:16,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:51:16,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:51:16,677 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-18 15:51:16,685 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-18 15:51:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:51:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 15:51:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 15:51:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:51:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:51:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:51:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-18 15:51:16,743 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:51:16,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-18 15:51:16,743 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-18 15:51:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:51:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:51:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-18 15:51:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-18 15:51:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-18 15:51:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-18 15:51:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-18 15:51:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 15:51:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 15:51:16,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-18 15:51:16,826 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:51:16,828 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:51:16,994 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-18 15:51:16,995 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:51:17,012 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:51:17,012 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-18 15:51:17,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:51:17 BoogieIcfgContainer [2024-09-18 15:51:17,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:51:17,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:51:17,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:51:17,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:51:17,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:51:16" (1/3) ... [2024-09-18 15:51:17,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f792af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:51:17, skipping insertion in model container [2024-09-18 15:51:17,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:16" (2/3) ... [2024-09-18 15:51:17,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f792af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:51:17, skipping insertion in model container [2024-09-18 15:51:17,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:51:17" (3/3) ... [2024-09-18 15:51:17,019 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-18 15:51:17,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:51:17,032 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 15:51:17,082 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:51:17,088 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;@3420d36d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:51:17,088 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 15:51:17,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-18 15:51:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-18 15:51:17,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:17,099 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 15:51:17,099 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:17,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-18 15:51:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:51:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233490286] [2024-09-18 15:51:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:51:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:51:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:51:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 15:51:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-18 15:51:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-18 15:51:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-18 15:51:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:51:17,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:51:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233490286] [2024-09-18 15:51:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233490286] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-18 15:51:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476820114] [2024-09-18 15:51:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:17,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-18 15:51:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:51:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-18 15:51:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-18 15:51:17,345 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:17,431 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-18 15:51:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-18 15:51:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2024-09-18 15:51:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:17,438 INFO L225 Difference]: With dead ends: 82 [2024-09-18 15:51:17,438 INFO L226 Difference]: Without dead ends: 38 [2024-09-18 15:51:17,440 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-18 15:51:17,443 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:17,443 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:51:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-18 15:51:17,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-18 15:51:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-18 15:51:17,470 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-18 15:51:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:17,471 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-18 15:51:17,471 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:17,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-18 15:51:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-18 15:51:17,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:17,473 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 15:51:17,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:51:17,473 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:17,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-18 15:51:17,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:51:17,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032386301] [2024-09-18 15:51:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:51:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:51:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:51:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 15:51:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-18 15:51:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-18 15:51:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-18 15:51:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:51:17,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:51:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032386301] [2024-09-18 15:51:17,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032386301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:17,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:17,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-18 15:51:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038248299] [2024-09-18 15:51:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:17,938 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-18 15:51:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:51:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-18 15:51:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-18 15:51:17,939 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-18 15:51:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:18,148 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-18 15:51:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-18 15:51:18,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-18 15:51:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:18,149 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:51:18,150 INFO L226 Difference]: Without dead ends: 39 [2024-09-18 15:51:18,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-09-18 15:51:18,151 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:18,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:51:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-18 15:51:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-18 15:51:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 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), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-18 15:51:18,161 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 40 [2024-09-18 15:51:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:18,163 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-18 15:51:18,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-18 15:51:18,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-18 15:51:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-18 15:51:18,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:18,164 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 15:51:18,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:51:18,164 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:18,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1492030389, now seen corresponding path program 1 times [2024-09-18 15:51:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:51:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722516759] [2024-09-18 15:51:18,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:51:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:51:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:51:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 15:51:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-18 15:51:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-18 15:51:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-18 15:51:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:51:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:51:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722516759] [2024-09-18 15:51:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722516759] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-18 15:51:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286908163] [2024-09-18 15:51:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:18,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-18 15:51:18,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:51:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-18 15:51:18,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:51:18,389 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-18 15:51:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:18,582 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-18 15:51:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 15:51:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-18 15:51:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:18,583 INFO L225 Difference]: With dead ends: 45 [2024-09-18 15:51:18,584 INFO L226 Difference]: Without dead ends: 41 [2024-09-18 15:51:18,584 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-09-18 15:51:18,585 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:18,585 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 65 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:51:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-18 15:51:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-18 15:51:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-18 15:51:18,590 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 40 [2024-09-18 15:51:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:18,590 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-18 15:51:18,590 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-18 15:51:18,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-18 15:51:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-18 15:51:18,591 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:18,591 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-09-18 15:51:18,591 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-18 15:51:18,591 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:18,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1098010380, now seen corresponding path program 1 times [2024-09-18 15:51:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:51:18,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425353769] [2024-09-18 15:51:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:51:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:51:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:51:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 15:51:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-18 15:51:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-18 15:51:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-18 15:51:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 15:51:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:51:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:51:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425353769] [2024-09-18 15:51:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425353769] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:18,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-18 15:51:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373703860] [2024-09-18 15:51:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:18,964 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-18 15:51:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:51:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-18 15:51:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:51:18,965 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:51:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:19,224 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-09-18 15:51:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 15:51:19,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2024-09-18 15:51:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:19,226 INFO L225 Difference]: With dead ends: 60 [2024-09-18 15:51:19,226 INFO L226 Difference]: Without dead ends: 45 [2024-09-18 15:51:19,226 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-18 15:51:19,227 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:19,227 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-18 15:51:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-18 15:51:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-18 15:51:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-18 15:51:19,233 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2024-09-18 15:51:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:19,234 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-18 15:51:19,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:51:19,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-18 15:51:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-18 15:51:19,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:19,235 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, 1, 1, 1, 1] [2024-09-18 15:51:19,235 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-18 15:51:19,236 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:19,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-18 15:51:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:51:19,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157447873] [2024-09-18 15:51:19,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:51:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:51:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:51:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-18 15:51:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-18 15:51:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-18 15:51:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-18 15:51:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-18 15:51:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-18 15:51:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:51:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157447873] [2024-09-18 15:51:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157447873] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:51:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156484788] [2024-09-18 15:51:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:19,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:51:19,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:51:19,481 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-18 15:51:19,485 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-18 15:51:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:19,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-18 15:51:19,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:51:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-18 15:51:19,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:51:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-18 15:51:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156484788] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:51:20,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:51:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-09-18 15:51:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450911670] [2024-09-18 15:51:20,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:51:20,173 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-18 15:51:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:51:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-18 15:51:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-09-18 15:51:20,174 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:51:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:20,387 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-09-18 15:51:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 15:51:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-09-18 15:51:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:20,388 INFO L225 Difference]: With dead ends: 46 [2024-09-18 15:51:20,388 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 15:51:20,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-09-18 15:51:20,389 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:20,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:51:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 15:51:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 15:51:20,390 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-18 15:51:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 15:51:20,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-18 15:51:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:20,390 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 15:51:20,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-18 15:51:20,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 15:51:20,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 15:51:20,392 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-18 15:51:20,404 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-18 15:51:20,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:51:20,599 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-18 15:51:20,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-18 15:51:21,158 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-18 15:51:21,173 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-09-18 15:51:21,174 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-09-18 15:51:21,179 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.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.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionToString(BacktranslationService.java:92) 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:60) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:152) 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-18 15:51:21,182 INFO L158 Benchmark]: Toolchain (without parser) took 4808.10ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 84.5MB in the beginning and 69.4MB in the end (delta: 15.1MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,182 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 104.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-18 15:51:21,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 72.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.78ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 956.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,183 INFO L158 Benchmark]: Boogie Preprocessor took 50.06ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,183 INFO L158 Benchmark]: RCFGBuilder took 372.35ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 69.1MB in the beginning and 173.6MB in the end (delta: -104.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,183 INFO L158 Benchmark]: TraceAbstraction took 4167.17ms. Allocated memory is still 213.9MB. Free memory was 173.6MB in the beginning and 69.4MB in the end (delta: 104.2MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2024-09-18 15:51:21,184 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.11ms. Allocated memory is still 155.2MB. Free memory was 105.0MB in the beginning and 104.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 72.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.78ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 71.3MB in the end (delta: 956.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.06ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.35ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 69.1MB in the beginning and 173.6MB in the end (delta: -104.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4167.17ms. Allocated memory is still 213.9MB. Free memory was 173.6MB in the beginning and 69.4MB in the end (delta: 104.2MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base * 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: 13]: 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 8 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 66 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 12 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 95/101 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((\old(x) == x) && (\old(y) == y)) && (\old(n) == n)) - 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-18 15:51:21,220 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/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:51:23,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:51:23,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-18 15:51:23,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:51:23,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:51:23,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:51:23,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:51:23,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:51:23,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:51:23,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:51:23,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:51:23,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:51:23,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:51:23,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:51:23,129 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:51:23,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:51:23,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:51:23,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-18 15:51:23,130 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-18 15:51:23,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:51:23,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-18 15:51:23,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:51:23,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:51:23,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:51:23,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:51:23,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:51:23,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:51:23,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-18 15:51:23,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:51:23,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:51:23,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:51:23,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:51:23,135 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-18 15:51:23,135 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-18 15:51:23,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:51:23,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:51:23,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:51:23,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:51:23,417 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:51:23,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-18 15:51:24,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:51:24,891 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:51:24,891 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-18 15:51:24,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/daa200305/49d3277639034c3a9bbae3d2d57b1e75/FLAG6521869ce [2024-09-18 15:51:24,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/daa200305/49d3277639034c3a9bbae3d2d57b1e75 [2024-09-18 15:51:24,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:51:24,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:51:24,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:51:24,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:51:24,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:51:24,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:51:24" (1/1) ... [2024-09-18 15:51:24,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2badf94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:24, skipping insertion in model container [2024-09-18 15:51:24,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:51:24" (1/1) ... [2024-09-18 15:51:24,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:51:25,067 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/lcp.c[515,528] [2024-09-18 15:51:25,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:51:25,106 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:51:25,116 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/lcp.c[515,528] [2024-09-18 15:51:25,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:51:25,148 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:51:25,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25 WrapperNode [2024-09-18 15:51:25,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:51:25,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:51:25,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:51:25,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:51:25,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,172 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:51:25,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:51:25,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:51:25,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:51:25,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:51:25,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,201 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-09-18 15:51:25,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:51:25,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:51:25,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:51:25,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:51:25,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (1/1) ... [2024-09-18 15:51:25,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:51:25,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:51:25,260 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-18 15:51:25,269 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-18 15:51:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 15:51:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:51:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:51:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-18 15:51:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:51:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-18 15:51:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-18 15:51:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:51:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:51:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-18 15:51:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-18 15:51:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 15:51:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 15:51:25,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-18 15:51:25,370 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:51:25,371 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:51:25,554 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-18 15:51:25,556 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:51:25,579 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:51:25,583 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-18 15:51:25,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:51:25 BoogieIcfgContainer [2024-09-18 15:51:25,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:51:25,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:51:25,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:51:25,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:51:25,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:51:24" (1/3) ... [2024-09-18 15:51:25,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9851f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:51:25, skipping insertion in model container [2024-09-18 15:51:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:51:25" (2/3) ... [2024-09-18 15:51:25,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9851f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:51:25, skipping insertion in model container [2024-09-18 15:51:25,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:51:25" (3/3) ... [2024-09-18 15:51:25,591 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-18 15:51:25,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:51:25,605 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 15:51:25,653 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:51:25,659 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;@592a219c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:51:25,659 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 15:51:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-18 15:51:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-18 15:51:25,669 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:25,670 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 15:51:25,670 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:25,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-18 15:51:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:51:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823118672] [2024-09-18 15:51:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:25,689 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-18 15:51:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:51:25,692 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-18 15:51:25,694 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-18 15:51:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:25,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-18 15:51:25,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:51:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:51:25,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:51:25,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:51:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823118672] [2024-09-18 15:51:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823118672] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-18 15:51:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39593663] [2024-09-18 15:51:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:25,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-18 15:51:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:51:25,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-18 15:51:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 15:51:25,862 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:25,891 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-18 15:51:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-18 15:51:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2024-09-18 15:51:25,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:25,899 INFO L225 Difference]: With dead ends: 82 [2024-09-18 15:51:25,899 INFO L226 Difference]: Without dead ends: 38 [2024-09-18 15:51:25,902 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-18 15:51:25,906 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:25,906 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:51:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-18 15:51:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-18 15:51:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-18 15:51:25,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-18 15:51:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:25,944 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-18 15:51:25,945 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:25,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-18 15:51:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-18 15:51:25,948 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:25,948 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-18 15:51:25,954 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 (2)] Ended with exit code 0 [2024-09-18 15:51:26,149 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-18 15:51:26,150 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:26,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-18 15:51:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:51:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564976802] [2024-09-18 15:51:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:26,152 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-18 15:51:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:51:26,155 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-18 15:51:26,156 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-18 15:51:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:26,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-18 15:51:26,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:51:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:51:26,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:51:26,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:51:26,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564976802] [2024-09-18 15:51:26,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564976802] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:51:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:51:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-18 15:51:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896836800] [2024-09-18 15:51:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:51:26,356 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-18 15:51:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:51:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-18 15:51:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:51:26,359 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:51:26,513 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-18 15:51:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-18 15:51:26,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-09-18 15:51:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:51:26,515 INFO L225 Difference]: With dead ends: 58 [2024-09-18 15:51:26,515 INFO L226 Difference]: Without dead ends: 41 [2024-09-18 15:51:26,516 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-18 15:51:26,517 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:51:26,517 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:51:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-18 15:51:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-18 15:51:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:51:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-18 15:51:26,529 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 40 [2024-09-18 15:51:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:51:26,531 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-18 15:51:26,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:51:26,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-18 15:51:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-18 15:51:26,534 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:51:26,535 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] [2024-09-18 15:51:26,538 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-18 15:51:26,735 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-18 15:51:26,735 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:51:26,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:51:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash 46925806, now seen corresponding path program 1 times [2024-09-18 15:51:26,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:51:26,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682705698] [2024-09-18 15:51:26,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:26,737 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-18 15:51:26,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:51:26,739 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-18 15:51:26,740 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-18 15:51:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:26,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-18 15:51:26,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:51:27,405 INFO L349 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2024-09-18 15:51:27,406 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 42 treesize of output 16 [2024-09-18 15:51:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:51:27,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:51:35,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:51:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682705698] [2024-09-18 15:51:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682705698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:51:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [490292571] [2024-09-18 15:51:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:51:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-18 15:51:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-18 15:51:35,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-18 15:51:35,810 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-09-18 15:51:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:51:35,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-18 15:51:35,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:51:35,957 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-18 15:51:40,096 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_2) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-18 15:51:44,170 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_3))) is different from true [2024-09-18 15:52:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-18 15:52:00,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:52:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [490292571] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:52:21,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:52:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2024-09-18 15:52:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216310669] [2024-09-18 15:52:21,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:52:21,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-18 15:52:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:52:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-18 15:52:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=798, Unknown=13, NotChecked=114, Total=992 [2024-09-18 15:52:21,103 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-18 15:53:02,504 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-18 15:53:06,509 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-18 15:54:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:54:04,704 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-18 15:54:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-18 15:54:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-18 15:54:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:54:04,706 INFO L225 Difference]: With dead ends: 89 [2024-09-18 15:54:04,706 INFO L226 Difference]: Without dead ends: 66 [2024-09-18 15:54:04,708 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 148.1s TimeCoverageRelationStatistics Valid=255, Invalid=2914, Unknown=31, NotChecked=222, Total=3422 [2024-09-18 15:54:04,710 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:54:04,712 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 384 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 603 Invalid, 2 Unknown, 149 Unchecked, 9.0s Time] [2024-09-18 15:54:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-18 15:54:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-09-18 15:54:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-18 15:54:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-18 15:54:04,738 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 43 [2024-09-18 15:54:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:54:04,738 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-18 15:54:04,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-18 15:54:04,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:54:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-18 15:54:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-18 15:54:04,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:54:04,742 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] [2024-09-18 15:54:04,749 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 (4)] Ended with exit code 0 [2024-09-18 15:54:04,947 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-09-18 15:54:05,143 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,5 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-18 15:54:05,145 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:54:05,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:54:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1935896750, now seen corresponding path program 1 times [2024-09-18 15:54:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:54:05,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643716555] [2024-09-18 15:54:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:54:05,146 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-18 15:54:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:54:05,147 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-18 15:54:05,149 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-18 15:54:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:54:05,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-18 15:54:05,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:54:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:54:05,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:54:05,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:54:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643716555] [2024-09-18 15:54:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643716555] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:54:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:54:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-18 15:54:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543143097] [2024-09-18 15:54:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:54:05,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-18 15:54:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:54:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-18 15:54:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-18 15:54:05,218 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:54:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:54:05,257 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-09-18 15:54:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-18 15:54:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-18 15:54:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:54:05,259 INFO L225 Difference]: With dead ends: 87 [2024-09-18 15:54:05,259 INFO L226 Difference]: Without dead ends: 61 [2024-09-18 15:54:05,259 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-18 15:54:05,260 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:54:05,260 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:54:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-18 15:54:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-18 15:54:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-18 15:54:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-09-18 15:54:05,274 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 43 [2024-09-18 15:54:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:54:05,275 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-09-18 15:54:05,275 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-18 15:54:05,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:54:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-09-18 15:54:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-18 15:54:05,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:54:05,279 INFO L216 NwaCegarLoop]: trace histogram [3, 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] [2024-09-18 15:54:05,286 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 (6)] Ended with exit code 0 [2024-09-18 15:54:05,479 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-18 15:54:05,480 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:54:05,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:54:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash 204017195, now seen corresponding path program 1 times [2024-09-18 15:54:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:54:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027785150] [2024-09-18 15:54:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:54:05,481 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-18 15:54:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:54:05,483 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-18 15:54:05,484 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-18 15:54:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:54:05,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-18 15:54:05,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:54:08,164 INFO L349 Elim1Store]: treesize reduction 104, result has 39.9 percent of original size [2024-09-18 15:54:08,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 81 [2024-09-18 15:54:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:54:08,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:54:16,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:54:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027785150] [2024-09-18 15:54:16,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027785150] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:54:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024760215] [2024-09-18 15:54:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:54:16,962 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-18 15:54:16,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-18 15:54:16,963 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-18 15:54:16,965 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-18 15:54:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:54:17,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-18 15:54:17,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:54:17,076 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-18 15:54:21,345 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_5) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-18 15:54:25,465 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_6) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-18 15:54:29,748 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#2| v_check_~a.base_BEFORE_CALL_3))) is different from true [2024-09-18 15:54:29,870 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 35 treesize of output 29 [2024-09-18 15:54:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-09-18 15:54:29,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:54:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1024760215] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:54:50,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:54:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-18 15:54:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236419928] [2024-09-18 15:54:50,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:54:50,251 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-18 15:54:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:54:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-18 15:54:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1107, Unknown=10, NotChecked=204, Total=1406 [2024-09-18 15:54:50,252 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-18 15:55:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:55:31,467 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-09-18 15:55:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-18 15:55:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 46 [2024-09-18 15:55:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:55:31,470 INFO L225 Difference]: With dead ends: 87 [2024-09-18 15:55:31,470 INFO L226 Difference]: Without dead ends: 83 [2024-09-18 15:55:31,471 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 81.8s TimeCoverageRelationStatistics Valid=224, Invalid=2962, Unknown=18, NotChecked=336, Total=3540 [2024-09-18 15:55:31,471 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-09-18 15:55:31,472 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 507 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1058 Invalid, 0 Unknown, 477 Unchecked, 2.6s Time] [2024-09-18 15:55:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-18 15:55:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-09-18 15:55:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:55:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-18 15:55:31,490 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2024-09-18 15:55:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:55:31,491 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-18 15:55:31,491 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-18 15:55:31,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-18 15:55:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-18 15:55:31,492 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:55:31,492 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, 1, 1, 1, 1] [2024-09-18 15:55:31,496 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 (7)] Forceful destruction successful, exit code 0 [2024-09-18 15:55:31,699 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-09-18 15:55:31,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-18 15:55:31,898 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:55:31,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-18 15:55:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:55:31,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747678270] [2024-09-18 15:55:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:55:31,899 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-18 15:55:31,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:55:31,902 INFO L229 MonitoredProcess]: Starting monitored process 9 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-18 15:55:31,902 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 (9)] Waiting until timeout for monitored process [2024-09-18 15:55:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:55:32,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-18 15:55:32,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:55:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:55:33,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:55:34,539 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-18 15:55:34,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:55:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747678270] [2024-09-18 15:55:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747678270] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:55:34,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:55:34,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-09-18 15:55:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416456754] [2024-09-18 15:55:34,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:55:34,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-18 15:55:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:55:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-18 15:55:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-09-18 15:55:34,541 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-18 15:55:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:55:36,918 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-09-18 15:55:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-18 15:55:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2024-09-18 15:55:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:55:36,921 INFO L225 Difference]: With dead ends: 90 [2024-09-18 15:55:36,921 INFO L226 Difference]: Without dead ends: 61 [2024-09-18 15:55:36,922 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2024-09-18 15:55:36,923 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-18 15:55:36,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 484 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-18 15:55:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-18 15:55:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-18 15:55:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:55:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-09-18 15:55:36,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 50 [2024-09-18 15:55:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:55:36,945 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-09-18 15:55:36,945 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-18 15:55:36,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-09-18 15:55:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-18 15:55:36,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:55:36,946 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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-18 15:55:36,952 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 (9)] Forceful destruction successful, exit code 0 [2024-09-18 15:55:37,146 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-18 15:55:37,147 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:55:37,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 972856628, now seen corresponding path program 2 times [2024-09-18 15:55:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:55:37,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090134510] [2024-09-18 15:55:37,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-18 15:55:37,148 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-18 15:55:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:55:37,150 INFO L229 MonitoredProcess]: Starting monitored process 10 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-18 15:55:37,151 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 (10)] Waiting until timeout for monitored process [2024-09-18 15:55:37,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-18 15:55:37,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 15:55:37,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-18 15:55:37,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:55:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-18 15:55:38,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:55:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-18 15:55:40,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:55:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090134510] [2024-09-18 15:55:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090134510] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:55:40,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:55:40,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2024-09-18 15:55:40,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429959753] [2024-09-18 15:55:40,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:55:40,655 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-18 15:55:40,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:55:40,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-18 15:55:40,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2024-09-18 15:55:40,656 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-18 15:55:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:55:48,942 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-09-18 15:55:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-18 15:55:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 59 [2024-09-18 15:55:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:55:48,944 INFO L225 Difference]: With dead ends: 114 [2024-09-18 15:55:48,944 INFO L226 Difference]: Without dead ends: 79 [2024-09-18 15:55:48,944 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=558, Invalid=3224, Unknown=0, NotChecked=0, Total=3782 [2024-09-18 15:55:48,945 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-09-18 15:55:48,945 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 465 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-09-18 15:55:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-18 15:55:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-18 15:55:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-18 15:55:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2024-09-18 15:55:48,988 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 59 [2024-09-18 15:55:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:55:48,988 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2024-09-18 15:55:48,989 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-18 15:55:48,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2024-09-18 15:55:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-18 15:55:48,991 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:55:48,991 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 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-18 15:55:49,000 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 (10)] Forceful destruction successful, exit code 0 [2024-09-18 15:55:49,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-18 15:55:49,192 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:55:49,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1516811372, now seen corresponding path program 3 times [2024-09-18 15:55:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-18 15:55:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477288969] [2024-09-18 15:55:49,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-18 15:55:49,194 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-18 15:55:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-18 15:55:49,195 INFO L229 MonitoredProcess]: Starting monitored process 11 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-18 15:55:49,196 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 (11)] Waiting until timeout for monitored process [2024-09-18 15:55:49,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-18 15:55:49,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 15:55:49,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-18 15:55:49,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:55:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-09-18 15:55:50,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:55:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-09-18 15:55:52,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-18 15:55:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477288969] [2024-09-18 15:55:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477288969] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:55:52,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:55:52,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-09-18 15:55:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408931537] [2024-09-18 15:55:52,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:55:52,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-18 15:55:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-18 15:55:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-18 15:55:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-09-18 15:55:52,499 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-18 15:55:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:55:53,410 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2024-09-18 15:55:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-18 15:55:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2024-09-18 15:55:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:55:53,411 INFO L225 Difference]: With dead ends: 78 [2024-09-18 15:55:53,411 INFO L226 Difference]: Without dead ends: 0 [2024-09-18 15:55:53,412 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-09-18 15:55:53,412 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-18 15:55:53,413 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 253 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-18 15:55:53,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-18 15:55:53,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-18 15:55:53,413 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-18 15:55:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-18 15:55:53,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-09-18 15:55:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:55:53,414 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-18 15:55:53,414 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-18 15:55:53,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:55:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-18 15:55:53,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-18 15:55:53,416 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-18 15:55:53,423 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 (11)] Ended with exit code 0 [2024-09-18 15:55:53,620 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-18 15:55:53,623 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-09-18 15:55:53,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.