./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 ca4ee3dd 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-ca4ee3d-m [2024-09-20 19:00:50,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:00:50,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:00:50,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:00:50,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:00:50,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:00:50,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:00:50,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:00:50,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:00:50,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:00:50,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:00:50,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:00:50,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:00:50,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:00:50,978 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:00:50,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:00:50,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:00:50,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:00:50,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:00:50,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:00:50,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:00:50,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:00:50,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:00:50,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:00:50,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:00:50,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:00:50,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:00:50,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:00:50,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:00:50,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:00:50,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:00:50,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:00:50,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:00:50,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:00:50,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:00:50,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:00:50,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:00:50,988 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-20 19:00:51,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:00:51,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:00:51,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:00:51,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:00:51,217 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:00:51,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-20 19:00:52,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:00:52,615 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:00:52,616 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-20 19:00:52,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d1602416d/1b877275cdcf485190d12bc9f9244765/FLAG5ce06524b [2024-09-20 19:00:52,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d1602416d/1b877275cdcf485190d12bc9f9244765 [2024-09-20 19:00:52,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:00:52,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:00:52,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:00:52,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:00:52,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:00:52,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89ca697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52, skipping insertion in model container [2024-09-20 19:00:52,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:00:52,793 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-20 19:00:52,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:00:52,816 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:00:52,825 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-20 19:00:52,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:00:52,844 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:00:52,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52 WrapperNode [2024-09-20 19:00:52,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:00:52,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:00:52,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:00:52,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:00:52,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,871 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:00:52,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:00:52,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:00:52,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:00:52,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:00:52,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,908 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-20 19:00:52,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:00:52,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:00:52,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:00:52,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:00:52,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:00:52,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:52,959 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-20 19:00:52,961 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-20 19:00:52,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:00:52,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:00:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:00:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:00:53,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:00:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:00:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 19:00:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 19:00:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 19:00:53,002 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 19:00:53,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:00:53,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:00:53,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 19:00:53,002 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-20 19:00:53,002 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-20 19:00:53,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:00:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:00:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 19:00:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 19:00:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 19:00:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 19:00:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 19:00:53,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:00:53,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:00:53,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 19:00:53,078 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:00:53,082 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:00:53,262 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-20 19:00:53,262 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:00:53,288 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:00:53,288 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:00:53,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:00:53 BoogieIcfgContainer [2024-09-20 19:00:53,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:00:53,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:00:53,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:00:53,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:00:53,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:00:52" (1/3) ... [2024-09-20 19:00:53,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1739f7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:00:53, skipping insertion in model container [2024-09-20 19:00:53,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52" (2/3) ... [2024-09-20 19:00:53,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1739f7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:00:53, skipping insertion in model container [2024-09-20 19:00:53,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:00:53" (3/3) ... [2024-09-20 19:00:53,297 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-20 19:00:53,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:00:53,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:00:53,352 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:00:53,357 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;@38b5c724, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:00:53,357 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:00:53,360 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-20 19:00:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 19:00:53,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:53,367 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-20 19:00:53,367 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:53,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-20 19:00:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993996317] [2024-09-20 19:00:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:00:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 19:00:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,585 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-20 19:00:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993996317] [2024-09-20 19:00:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993996317] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:53,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:53,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 19:00:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018460527] [2024-09-20 19:00:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:53,594 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 19:00:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:53,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 19:00:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 19:00:53,618 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-20 19:00:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:53,752 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-20 19:00:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 19:00:53,771 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-20 19:00:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:53,783 INFO L225 Difference]: With dead ends: 82 [2024-09-20 19:00:53,786 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 19:00:53,789 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-20 19:00:53,795 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-20 19:00:53,796 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-20 19:00:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 19:00:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 19:00:53,855 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-20 19:00:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-20 19:00:53,862 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-20 19:00:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:53,862 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-20 19:00:53,863 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-20 19:00:53,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-20 19:00:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:00:53,865 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:53,865 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-20 19:00:53,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:00:53,865 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:53,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-20 19:00:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614786396] [2024-09-20 19:00:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:00:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 19:00:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,267 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-20 19:00:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614786396] [2024-09-20 19:00:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614786396] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:54,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:54,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 19:00:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938101007] [2024-09-20 19:00:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:54,269 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 19:00:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 19:00:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:00:54,271 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-20 19:00:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:54,474 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-20 19:00:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:00:54,475 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-20 19:00:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:54,476 INFO L225 Difference]: With dead ends: 60 [2024-09-20 19:00:54,477 INFO L226 Difference]: Without dead ends: 39 [2024-09-20 19:00:54,477 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-20 19:00:54,478 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-20 19:00:54,479 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-20 19:00:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-20 19:00:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-20 19:00:54,484 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-20 19:00:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-20 19:00:54,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 40 [2024-09-20 19:00:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:54,486 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-20 19:00:54,486 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-20 19:00:54,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-20 19:00:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:00:54,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:54,487 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-20 19:00:54,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:00:54,487 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:54,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1492030389, now seen corresponding path program 1 times [2024-09-20 19:00:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205311508] [2024-09-20 19:00:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:00:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 19:00:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,731 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-20 19:00:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205311508] [2024-09-20 19:00:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205311508] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 19:00:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504181327] [2024-09-20 19:00:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:54,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:00:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:00:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:00:54,733 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-20 19:00:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:54,940 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-20 19:00:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 19:00:54,941 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-20 19:00:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:54,942 INFO L225 Difference]: With dead ends: 45 [2024-09-20 19:00:54,942 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 19:00:54,942 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-20 19:00:54,943 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-20 19:00:54,943 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-20 19:00:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 19:00:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 19:00:54,953 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-20 19:00:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-20 19:00:54,954 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 40 [2024-09-20 19:00:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:54,954 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-20 19:00:54,954 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-20 19:00:54,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-20 19:00:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 19:00:54,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:54,956 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-20 19:00:54,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 19:00:54,956 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:54,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1098010380, now seen corresponding path program 1 times [2024-09-20 19:00:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:54,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498788424] [2024-09-20 19:00:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:00:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 19:00:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 19:00:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,305 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-20 19:00:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498788424] [2024-09-20 19:00:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498788424] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 19:00:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791127046] [2024-09-20 19:00:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:55,306 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:00:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:00:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:00:55,307 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-20 19:00:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:55,581 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-09-20 19:00:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 19:00:55,581 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-20 19:00:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:55,582 INFO L225 Difference]: With dead ends: 60 [2024-09-20 19:00:55,583 INFO L226 Difference]: Without dead ends: 45 [2024-09-20 19:00:55,583 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-20 19:00:55,584 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-20 19:00:55,584 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-20 19:00:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-20 19:00:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-20 19:00:55,595 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-20 19:00:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-20 19:00:55,596 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2024-09-20 19:00:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:55,596 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-20 19:00:55,596 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-20 19:00:55,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-20 19:00:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 19:00:55,598 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:55,598 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-20 19:00:55,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 19:00:55,599 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:55,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-20 19:00:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646923458] [2024-09-20 19:00:55,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:00:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 19:00:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-20 19:00:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,905 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-20 19:00:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646923458] [2024-09-20 19:00:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646923458] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456018460] [2024-09-20 19:00:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:55,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:00:55,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:55,912 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-20 19:00:55,913 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-20 19:00:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 19:00:55,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:00:56,248 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-20 19:00:56,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:00:56,488 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-20 19:00:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456018460] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:00:56,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:00:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-09-20 19:00:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653772837] [2024-09-20 19:00:56,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:00:56,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 19:00:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 19:00:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-09-20 19:00:56,492 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-20 19:00:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:56,740 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-09-20 19:00:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 19:00:56,740 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-20 19:00:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:56,741 INFO L225 Difference]: With dead ends: 46 [2024-09-20 19:00:56,741 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:00:56,742 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-20 19:00:56,742 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:00:56,742 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.2s Time] [2024-09-20 19:00:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:00:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:00:56,743 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-20 19:00:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:00:56,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-20 19:00:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:56,744 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:00:56,744 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-20 19:00:56,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:00:56,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:00:56,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:00:56,762 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 19:00:56,951 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-20 19:00:56,954 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-20 19:00:56,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:00:57,486 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:00:57,497 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-09-20 19:00:57,498 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-09-20 19:00:57,504 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-20 19:00:57,506 INFO L158 Benchmark]: Toolchain (without parser) took 4869.61ms. Allocated memory was 132.1MB in the beginning and 218.1MB in the end (delta: 86.0MB). Free memory was 62.3MB in the beginning and 67.3MB in the end (delta: -5.0MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,506 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:00:57,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.38ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 62.1MB in the beginning and 147.1MB in the end (delta: -85.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.86ms. Allocated memory is still 180.4MB. Free memory was 147.1MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,507 INFO L158 Benchmark]: Boogie Preprocessor took 56.76ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,507 INFO L158 Benchmark]: RCFGBuilder took 359.58ms. Allocated memory is still 180.4MB. Free memory was 144.0MB in the beginning and 127.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,507 INFO L158 Benchmark]: TraceAbstraction took 4215.31ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 126.1MB in the beginning and 67.3MB in the end (delta: 58.9MB). Peak memory consumption was 96.6MB. Max. memory is 16.1GB. [2024-09-20 19:00:57,508 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.20ms. Allocated memory is still 132.1MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.38ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 62.1MB in the beginning and 147.1MB in the end (delta: -85.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.86ms. Allocated memory is still 180.4MB. Free memory was 147.1MB in the beginning and 146.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.76ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.58ms. Allocated memory is still 180.4MB. Free memory was 144.0MB in the beginning and 127.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4215.31ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 126.1MB in the beginning and 67.3MB in the end (delta: 58.9MB). Peak memory consumption was 96.6MB. 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.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s 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-20 19:00:57,529 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-ca4ee3d-m [2024-09-20 19:00:59,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:00:59,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-20 19:00:59,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:00:59,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:00:59,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:00:59,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:00:59,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:00:59,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:00:59,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:00:59,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:00:59,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:00:59,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:00:59,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:00:59,373 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:00:59,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:00:59,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:00:59,374 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:00:59,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:00:59,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:00:59,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:00:59,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:00:59,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:00:59,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:00:59,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:00:59,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:00:59,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:00:59,381 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-20 19:00:59,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-20 19:00:59,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:00:59,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:00:59,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:00:59,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:00:59,383 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-20 19:00:59,383 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-20 19:00:59,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:00:59,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:00:59,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:00:59,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:00:59,658 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:00:59,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-20 19:01:00,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:01:01,098 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:01:01,098 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-20 19:01:01,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ede861a08/12bca9fcd3d842e392748d287a00f7d3/FLAG92135faa7 [2024-09-20 19:01:01,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ede861a08/12bca9fcd3d842e392748d287a00f7d3 [2024-09-20 19:01:01,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:01:01,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:01:01,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:01:01,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:01:01,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:01:01,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec22d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01, skipping insertion in model container [2024-09-20 19:01:01,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:01:01,302 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-20 19:01:01,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:01:01,353 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:01:01,365 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-20 19:01:01,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:01:01,397 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:01:01,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01 WrapperNode [2024-09-20 19:01:01,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:01:01,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:01:01,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:01:01,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:01:01,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,424 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:01:01,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:01:01,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:01:01,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:01:01,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:01:01,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,456 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-20 19:01:01,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:01:01,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:01:01,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:01:01,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:01:01,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (1/1) ... [2024-09-20 19:01:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:01:01,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:01:01,510 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-20 19:01:01,518 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-20 19:01:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:01:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-20 19:01:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-20 19:01:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-09-20 19:01:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:01:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:01:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:01:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 19:01:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:01:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-09-20 19:01:01,562 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-20 19:01:01,562 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-20 19:01:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:01:01,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:01:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 19:01:01,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 19:01:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:01:01,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:01:01,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 19:01:01,652 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:01:01,655 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:01:01,895 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-20 19:01:01,897 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:01:01,928 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:01:01,929 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:01:01,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:01:01 BoogieIcfgContainer [2024-09-20 19:01:01,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:01:01,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:01:01,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:01:01,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:01:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:01:01" (1/3) ... [2024-09-20 19:01:01,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fde788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:01:01, skipping insertion in model container [2024-09-20 19:01:01,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:01:01" (2/3) ... [2024-09-20 19:01:01,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fde788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:01:01, skipping insertion in model container [2024-09-20 19:01:01,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:01:01" (3/3) ... [2024-09-20 19:01:01,937 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-20 19:01:01,951 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:01:01,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:01:02,001 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:01:02,009 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;@4228f4ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:01:02,009 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:01:02,013 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-20 19:01:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 19:01:02,020 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:01:02,021 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-20 19:01:02,021 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:01:02,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-20 19:01:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:01:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880712572] [2024-09-20 19:01:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:02,039 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-20 19:01:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:01:02,042 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-20 19:01:02,043 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-20 19:01:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:02,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-20 19:01:02,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:01:02,161 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-20 19:01:02,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:01:02,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:01:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880712572] [2024-09-20 19:01:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880712572] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:01:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:01:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:01:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785758673] [2024-09-20 19:01:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:01:02,169 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:01:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:01:02,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:01:02,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:01:02,190 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-20 19:01:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:01:02,222 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-20 19:01:02,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:01:02,225 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-20 19:01:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:01:02,230 INFO L225 Difference]: With dead ends: 82 [2024-09-20 19:01:02,231 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 19:01:02,234 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-20 19:01:02,238 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-20 19:01:02,239 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-20 19:01:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 19:01:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 19:01:02,265 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-20 19:01:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-20 19:01:02,267 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-20 19:01:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:01:02,268 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-20 19:01:02,268 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-20 19:01:02,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-20 19:01:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:01:02,270 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:01:02,270 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-20 19:01:02,277 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-09-20 19:01:02,474 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-20 19:01:02,475 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:01:02,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-20 19:01:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:01:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663508024] [2024-09-20 19:01:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:02,476 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-20 19:01:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:01:02,494 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-20 19:01:02,495 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-20 19:01:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:02,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 19:01:02,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:01:02,740 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-20 19:01:02,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:01:02,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:01:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663508024] [2024-09-20 19:01:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663508024] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:01:02,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:01:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-20 19:01:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394793518] [2024-09-20 19:01:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:01:02,746 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 19:01:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:01:02,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 19:01:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-20 19:01:02,748 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-20 19:01:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:01:02,908 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-20 19:01:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:01:02,910 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-20 19:01:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:01:02,911 INFO L225 Difference]: With dead ends: 58 [2024-09-20 19:01:02,912 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 19:01:02,912 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-20 19:01:02,914 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-20 19:01:02,914 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-20 19:01:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 19:01:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 19:01:02,922 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-20 19:01:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-20 19:01:02,923 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 40 [2024-09-20 19:01:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:01:02,924 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-20 19:01:02,924 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-20 19:01:02,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-20 19:01:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 19:01:02,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:01:02,927 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-20 19:01:02,930 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 (3)] Ended with exit code 0 [2024-09-20 19:01:03,128 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-20 19:01:03,128 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:01:03,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash 46925806, now seen corresponding path program 1 times [2024-09-20 19:01:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:01:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609638871] [2024-09-20 19:01:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:03,129 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-20 19:01:03,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:01:03,135 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-20 19:01:03,136 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-20 19:01:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:03,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-20 19:01:03,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:01:03,868 INFO L349 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2024-09-20 19:01:03,869 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-20 19:01:03,954 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-20 19:01:03,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:01:12,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:01:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609638871] [2024-09-20 19:01:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609638871] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:01:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968631545] [2024-09-20 19:01:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:12,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 19:01:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 19:01:12,276 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-20 19:01:12,277 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-20 19:01:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:12,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 19:01:12,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:01:12,434 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-20 19:01:16,606 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-20 19:01:20,695 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-20 19:01:33,354 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-20 19:01:33,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:01:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1968631545] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:01:45,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:01:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2024-09-20 19:01:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386410185] [2024-09-20 19:01:45,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:01:45,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-20 19:01:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:01:45,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-20 19:01:45,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=801, Unknown=10, NotChecked=114, Total=992 [2024-09-20 19:01:45,616 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-20 19:02:39,707 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-20 19:02:43,712 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-20 19:03:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:29,152 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-20 19:03:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-20 19:03:29,154 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-20 19:03:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:29,155 INFO L225 Difference]: With dead ends: 89 [2024-09-20 19:03:29,155 INFO L226 Difference]: Without dead ends: 66 [2024-09-20 19:03:29,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 136.1s TimeCoverageRelationStatistics Valid=254, Invalid=2916, Unknown=30, NotChecked=222, Total=3422 [2024-09-20 19:03:29,160 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:03:29,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 385 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 620 Invalid, 2 Unknown, 149 Unchecked, 9.0s Time] [2024-09-20 19:03:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-20 19:03:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-09-20 19:03:29,175 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-20 19:03:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-20 19:03:29,176 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 43 [2024-09-20 19:03:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:29,178 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-20 19:03:29,178 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-20 19:03:29,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-20 19:03:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 19:03:29,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:29,180 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-20 19:03:29,187 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-09-20 19:03:29,385 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-20 19:03:29,580 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-20 19:03:29,581 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:29,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1935896750, now seen corresponding path program 1 times [2024-09-20 19:03:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:03:29,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86137507] [2024-09-20 19:03:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:29,583 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-20 19:03:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:03:29,586 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-20 19:03:29,591 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-20 19:03:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:29,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-20 19:03:29,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:29,660 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-20 19:03:29,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:03:29,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:03:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86137507] [2024-09-20 19:03:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86137507] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:03:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 19:03:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905202038] [2024-09-20 19:03:29,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:29,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 19:03:29,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:03:29,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 19:03:29,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 19:03:29,665 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-20 19:03:29,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:29,700 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-09-20 19:03:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 19:03:29,701 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-20 19:03:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:29,704 INFO L225 Difference]: With dead ends: 87 [2024-09-20 19:03:29,705 INFO L226 Difference]: Without dead ends: 61 [2024-09-20 19:03:29,705 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-20 19:03:29,708 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-20 19:03:29,709 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-20 19:03:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-20 19:03:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-20 19:03:29,720 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-20 19:03:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-09-20 19:03:29,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 43 [2024-09-20 19:03:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:29,721 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-09-20 19:03:29,721 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-20 19:03:29,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-09-20 19:03:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 19:03:29,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:29,723 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-20 19:03:29,727 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-09-20 19:03:29,923 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-20 19:03:29,924 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:29,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash 204017195, now seen corresponding path program 1 times [2024-09-20 19:03:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:03:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157835222] [2024-09-20 19:03:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:29,928 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-20 19:03:29,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:03:29,932 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-20 19:03:29,933 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-20 19:03:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:30,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-20 19:03:30,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:33,020 INFO L349 Elim1Store]: treesize reduction 104, result has 39.9 percent of original size [2024-09-20 19:03:33,020 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-20 19:03:33,353 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-20 19:03:33,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:03:41,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:03:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157835222] [2024-09-20 19:03:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157835222] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [64113456] [2024-09-20 19:03:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:41,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 19:03:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 19:03:41,965 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-20 19:03:41,966 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-20 19:03:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:42,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-20 19:03:42,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:42,053 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-20 19:03:46,339 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-20 19:03:50,464 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-20 19:03:54,785 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-20 19:03:54,908 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-20 19:03:55,026 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-20 19:03:55,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:04:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [64113456] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:04:19,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:04:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-20 19:04:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772532059] [2024-09-20 19:04:19,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:04:19,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-20 19:04:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:04:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-20 19:04:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1106, Unknown=11, NotChecked=204, Total=1406 [2024-09-20 19:04:19,363 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-20 19:04:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:04:53,642 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-09-20 19:04:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-20 19:04:53,643 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-20 19:04:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:04:53,644 INFO L225 Difference]: With dead ends: 87 [2024-09-20 19:04:53,644 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 19:04:53,645 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=224, Invalid=2964, Unknown=16, NotChecked=336, Total=3540 [2024-09-20 19:04:53,646 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-09-20 19:04:53,646 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 507 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1058 Invalid, 0 Unknown, 477 Unchecked, 3.1s Time] [2024-09-20 19:04:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 19:04:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-09-20 19:04:53,661 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-20 19:04:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-20 19:04:53,663 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2024-09-20 19:04:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:04:53,664 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-20 19:04:53,665 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-20 19:04:53,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-20 19:04:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 19:04:53,669 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:04:53,670 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-20 19:04:53,676 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 (7)] Ended with exit code 0 [2024-09-20 19:04:53,874 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-09-20 19:04:54,071 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-20 19:04:54,071 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:04:54,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-20 19:04:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:04:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436256528] [2024-09-20 19:04:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:04:54,072 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-20 19:04:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:04:54,076 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-20 19:04:54,077 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-20 19:04:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:54,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-20 19:04:54,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:04:55,347 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-20 19:04:55,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:04:57,055 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-20 19:04:57,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:04:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436256528] [2024-09-20 19:04:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436256528] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:04:57,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:04:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-09-20 19:04:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968814537] [2024-09-20 19:04:57,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:04:57,056 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-20 19:04:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:04:57,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-20 19:04:57,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-09-20 19:04:57,057 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-20 19:04:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:04:59,869 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-09-20 19:04:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-20 19:04:59,870 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-20 19:04:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:04:59,871 INFO L225 Difference]: With dead ends: 90 [2024-09-20 19:04:59,871 INFO L226 Difference]: Without dead ends: 61 [2024-09-20 19:04:59,872 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2024-09-20 19:04:59,872 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-09-20 19:04:59,873 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 484 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-20 19:04:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-20 19:04:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-20 19:04:59,890 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-20 19:04:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-09-20 19:04:59,891 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 50 [2024-09-20 19:04:59,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:04:59,891 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-09-20 19:04:59,891 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-20 19:04:59,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-09-20 19:04:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 19:04:59,893 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:04:59,893 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-20 19:04:59,898 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-20 19:05:00,093 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-20 19:05:00,094 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:05:00,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:05:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 972856628, now seen corresponding path program 2 times [2024-09-20 19:05:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:05:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93816559] [2024-09-20 19:05:00,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:05:00,095 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-20 19:05:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:05:00,097 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-20 19:05:00,097 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-20 19:05:00,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:05:00,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:05:00,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-20 19:05:00,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:05:01,640 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-20 19:05:01,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:05:04,227 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-20 19:05:04,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:05:04,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93816559] [2024-09-20 19:05:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93816559] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:05:04,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:05:04,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2024-09-20 19:05:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320292290] [2024-09-20 19:05:04,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:05:04,228 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-20 19:05:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:05:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-20 19:05:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2024-09-20 19:05:04,229 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-20 19:05:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:05:14,267 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-09-20 19:05:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-20 19:05:14,268 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-20 19:05:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:05:14,270 INFO L225 Difference]: With dead ends: 114 [2024-09-20 19:05:14,270 INFO L226 Difference]: Without dead ends: 79 [2024-09-20 19:05:14,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=558, Invalid=3224, Unknown=0, NotChecked=0, Total=3782 [2024-09-20 19:05:14,271 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2024-09-20 19:05:14,271 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.6s Time] [2024-09-20 19:05:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-20 19:05:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-20 19:05:14,306 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-20 19:05:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2024-09-20 19:05:14,306 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 59 [2024-09-20 19:05:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:05:14,306 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2024-09-20 19:05:14,307 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-20 19:05:14,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:05:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2024-09-20 19:05:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-20 19:05:14,307 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:05:14,308 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-20 19:05:14,314 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 (10)] Ended with exit code 0 [2024-09-20 19:05:14,508 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-20 19:05:14,508 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:05:14,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:05:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1516811372, now seen corresponding path program 3 times [2024-09-20 19:05:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:05:14,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124187613] [2024-09-20 19:05:14,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 19:05:14,509 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-20 19:05:14,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:05:14,513 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-20 19:05:14,513 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-20 19:05:15,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 19:05:15,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:05:15,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-20 19:05:15,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:05:15,932 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-20 19:05:15,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:05:18,438 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-20 19:05:18,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:05:18,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124187613] [2024-09-20 19:05:18,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124187613] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:05:18,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:05:18,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-09-20 19:05:18,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928482277] [2024-09-20 19:05:18,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:05:18,440 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 19:05:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:05:18,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 19:05:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-09-20 19:05:18,441 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-20 19:05:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:05:19,438 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2024-09-20 19:05:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 19:05:19,439 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-20 19:05:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:05:19,440 INFO L225 Difference]: With dead ends: 78 [2024-09-20 19:05:19,440 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:05:19,440 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-09-20 19:05:19,441 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-20 19:05:19,441 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-20 19:05:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:05:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:05:19,442 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-20 19:05:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:05:19,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-09-20 19:05:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:05:19,442 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:05:19,443 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-20 19:05:19,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:05:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:05:19,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:05:19,445 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:05:19,452 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-20 19:05:19,646 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-20 19:05:19,648 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-09-20 19:05:19,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.