./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 f1d7dc9d 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-f1d7dc9-m [2024-09-20 12:16:59,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:17:00,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:17:00,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:17:00,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:17:00,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:17:00,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:17:00,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:17:00,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:17:00,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:17:00,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:17:00,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:17:00,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:17:00,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:17:00,067 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:17:00,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:17:00,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:17:00,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:17:00,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:17:00,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:17:00,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:17:00,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:17:00,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:17:00,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:17:00,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:17:00,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:17:00,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:17:00,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:17:00,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:17:00,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:17:00,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:17:00,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:17:00,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:17:00,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:17:00,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:17:00,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:17:00,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:17:00,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:17:00,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:17:00,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:17:00,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:17:00,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:17:00,078 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 12:17:00,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:17:00,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:17:00,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:17:00,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:17:00,367 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:17:00,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-20 12:17:01,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:17:02,153 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:17:02,153 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-20 12:17:02,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/dc603f198/e375392707914c2b981c445d0b7498c3/FLAG2e21914ff [2024-09-20 12:17:02,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/dc603f198/e375392707914c2b981c445d0b7498c3 [2024-09-20 12:17:02,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:17:02,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:17:02,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:17:02,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:17:02,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:17:02,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d4950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02, skipping insertion in model container [2024-09-20 12:17:02,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:17:02,343 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 12:17:02,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:17:02,420 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:17:02,435 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 12:17:02,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:17:02,470 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:17:02,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02 WrapperNode [2024-09-20 12:17:02,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:17:02,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:17:02,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:17:02,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:17:02,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,494 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:17:02,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:17:02,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:17:02,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:17:02,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:17:02,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,535 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6]. The 1 writes are split as follows [0, 1, 0]. [2024-09-20 12:17:02,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:17:02,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:17:02,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:17:02,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:17:02,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (1/1) ... [2024-09-20 12:17:02,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:17:02,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:02,608 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 12:17:02,614 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 12:17:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:17:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 12:17:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 12:17:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:17:02,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:17:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:17:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 12:17:02,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 12:17:02,665 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 12:17:02,665 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 12:17:02,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:17:02,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:17:02,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 12:17:02,666 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-20 12:17:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-20 12:17:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:17:02,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:17:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 12:17:02,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 12:17:02,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 12:17:02,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 12:17:02,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 12:17:02,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:17:02,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:17:02,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 12:17:02,772 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:17:02,774 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:17:02,969 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-20 12:17:02,970 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:17:03,000 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:17:03,000 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 12:17:03,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:17:03 BoogieIcfgContainer [2024-09-20 12:17:03,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:17:03,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:17:03,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:17:03,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:17:03,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:17:02" (1/3) ... [2024-09-20 12:17:03,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d77420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:17:03, skipping insertion in model container [2024-09-20 12:17:03,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:02" (2/3) ... [2024-09-20 12:17:03,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d77420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:17:03, skipping insertion in model container [2024-09-20 12:17:03,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:17:03" (3/3) ... [2024-09-20 12:17:03,009 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-20 12:17:03,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:17:03,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:17:03,091 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:17:03,100 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;@7d546ed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:17:03,101 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:17:03,106 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 12:17:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 12:17:03,114 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:03,115 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 12:17:03,116 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:03,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-20 12:17:03,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824609542] [2024-09-20 12:17:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:03,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 12:17:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-20 12:17:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,377 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 12:17:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824609542] [2024-09-20 12:17:03,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824609542] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:03,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:03,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:17:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567751315] [2024-09-20 12:17:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:03,384 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:17:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:17:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:17:03,414 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 12:17:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:03,518 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-20 12:17:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:17:03,521 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 12:17:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:03,529 INFO L225 Difference]: With dead ends: 82 [2024-09-20 12:17:03,529 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 12:17:03,533 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 12:17:03,537 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 12:17:03,539 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 12:17:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 12:17:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 12:17:03,623 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 12:17:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-20 12:17:03,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-20 12:17:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:03,634 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-20 12:17:03,635 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 12:17:03,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-20 12:17:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 12:17:03,637 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:03,637 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 12:17:03,638 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:17:03,638 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:03,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-20 12:17:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732772850] [2024-09-20 12:17:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:03,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 12:17:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 12:17:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,089 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 12:17:04,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732772850] [2024-09-20 12:17:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732772850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:04,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 12:17:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307968737] [2024-09-20 12:17:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:04,092 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:17:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:17:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:17:04,093 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 12:17:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:04,368 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-20 12:17:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 12:17:04,369 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 12:17:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:04,370 INFO L225 Difference]: With dead ends: 60 [2024-09-20 12:17:04,370 INFO L226 Difference]: Without dead ends: 39 [2024-09-20 12:17:04,371 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 12:17:04,372 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 12:17:04,374 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 12:17:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-20 12:17:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-20 12:17:04,388 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 12:17:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-20 12:17:04,391 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 40 [2024-09-20 12:17:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:04,394 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-20 12:17:04,394 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 12:17:04,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-20 12:17:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 12:17:04,396 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:04,396 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 12:17:04,396 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:17:04,397 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:04,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1492030389, now seen corresponding path program 1 times [2024-09-20 12:17:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865082070] [2024-09-20 12:17:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 12:17:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 12:17:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:04,828 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 12:17:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865082070] [2024-09-20 12:17:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865082070] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:17:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811524271] [2024-09-20 12:17:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:04,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 12:17:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 12:17:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-20 12:17:04,836 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 12:17:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:05,103 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-20 12:17:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:17:05,104 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 12:17:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:05,105 INFO L225 Difference]: With dead ends: 45 [2024-09-20 12:17:05,105 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 12:17:05,106 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 12:17:05,107 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 12:17:05,107 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.2s Time] [2024-09-20 12:17:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 12:17:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 12:17:05,114 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 12:17:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-20 12:17:05,115 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 40 [2024-09-20 12:17:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:05,116 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-20 12:17:05,116 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 12:17:05,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-20 12:17:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 12:17:05,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:05,118 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 12:17:05,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:17:05,118 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:05,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1098010380, now seen corresponding path program 1 times [2024-09-20 12:17:05,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:05,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137218191] [2024-09-20 12:17:05,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 12:17:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 12:17:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-20 12:17:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:05,514 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 12:17:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:05,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137218191] [2024-09-20 12:17:05,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137218191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:05,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:05,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 12:17:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102389374] [2024-09-20 12:17:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:05,516 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 12:17:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 12:17:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-20 12:17:05,517 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 12:17:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:05,839 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-09-20 12:17:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:17:05,840 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 12:17:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:05,842 INFO L225 Difference]: With dead ends: 60 [2024-09-20 12:17:05,842 INFO L226 Difference]: Without dead ends: 45 [2024-09-20 12:17:05,843 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 12:17:05,843 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 12:17:05,844 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 12:17:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-20 12:17:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-20 12:17:05,851 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 12:17:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-20 12:17:05,852 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2024-09-20 12:17:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:05,853 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-20 12:17:05,853 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 12:17:05,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-20 12:17:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 12:17:05,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:05,854 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 12:17:05,855 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:17:05,855 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:05,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-20 12:17:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824241116] [2024-09-20 12:17:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:17:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:17:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 12:17:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 12:17:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 12:17:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 12:17:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 12:17:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-20 12:17:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,169 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 12:17:06,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:17:06,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824241116] [2024-09-20 12:17:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824241116] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153883339] [2024-09-20 12:17:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:06,172 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 12:17:06,174 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 12:17:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:06,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 12:17:06,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:06,574 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 12:17:06,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:06,883 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 12:17:06,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153883339] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:17:06,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:17:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-09-20 12:17:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147360287] [2024-09-20 12:17:06,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:17:06,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 12:17:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:06,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 12:17:06,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-09-20 12:17:06,886 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 12:17:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:07,152 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-09-20 12:17:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 12:17:07,152 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 12:17:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:07,153 INFO L225 Difference]: With dead ends: 46 [2024-09-20 12:17:07,153 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 12:17:07,154 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 12:17:07,155 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 12:17:07,155 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 12:17:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 12:17:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 12:17:07,156 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 12:17:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 12:17:07,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-20 12:17:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:07,156 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 12:17:07,157 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 12:17:07,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 12:17:07,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 12:17:07,160 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 12:17:07,181 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 12:17:07,360 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 12:17:07,364 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-20 12:17:07,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 12:17:08,049 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 12:17:08,061 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-09-20 12:17:08,062 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-09-20 12:17:08,074 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 12:17:08,083 INFO L158 Benchmark]: Toolchain (without parser) took 5905.23ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 86.2MB in the beginning and 209.1MB in the end (delta: -122.9MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,083 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory was 113.3MB in the beginning and 113.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 12:17:08,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.33ms. Allocated memory is still 157.3MB. Free memory was 85.9MB in the beginning and 126.2MB in the end (delta: -40.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.90ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 125.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,084 INFO L158 Benchmark]: Boogie Preprocessor took 70.48ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 123.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,084 INFO L158 Benchmark]: RCFGBuilder took 434.35ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 106.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,085 INFO L158 Benchmark]: TraceAbstraction took 5079.44ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 105.2MB in the beginning and 209.1MB in the end (delta: -103.9MB). Peak memory consumption was 103.8MB. Max. memory is 16.1GB. [2024-09-20 12:17:08,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory was 113.3MB in the beginning and 113.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.33ms. Allocated memory is still 157.3MB. Free memory was 85.9MB in the beginning and 126.2MB in the end (delta: -40.2MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.90ms. Allocated memory is still 157.3MB. Free memory was 126.2MB in the beginning and 125.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.48ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 123.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.35ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 106.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5079.44ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 105.2MB in the beginning and 209.1MB in the end (delta: -103.9MB). Peak memory consumption was 103.8MB. 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: 4.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.7s 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.6s 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, 2.2s 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 12:17:08,121 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:17:10,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:17:10,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-20 12:17:10,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:17:10,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:17:10,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:17:10,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:17:10,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:17:10,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:17:10,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:17:10,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:17:10,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:17:10,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:17:10,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:17:10,495 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:17:10,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:17:10,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:17:10,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:17:10,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:17:10,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:17:10,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:17:10,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:17:10,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:17:10,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-20 12:17:10,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-20 12:17:10,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:17:10,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-20 12:17:10,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:17:10,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:17:10,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:17:10,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:17:10,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:17:10,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:17:10,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:17:10,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:17:10,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:17:10,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:17:10,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:17:10,504 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-20 12:17:10,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-20 12:17:10,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:17:10,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:17:10,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:17:10,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:17:10,505 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-20 12:17:10,505 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 12:17:10,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:17:10,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:17:10,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:17:10,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:17:10,858 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:17:10,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-20 12:17:12,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:17:12,789 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:17:12,791 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-20 12:17:12,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e438af181/e72b107f52194ea7a8fc5367b62eb890/FLAG2ea9799b8 [2024-09-20 12:17:12,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e438af181/e72b107f52194ea7a8fc5367b62eb890 [2024-09-20 12:17:12,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:17:12,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:17:12,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:17:12,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:17:12,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:17:12,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:17:12" (1/1) ... [2024-09-20 12:17:12,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc0433b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:12, skipping insertion in model container [2024-09-20 12:17:12,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:17:12" (1/1) ... [2024-09-20 12:17:12,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:17:13,013 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 12:17:13,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:17:13,068 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:17:13,083 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 12:17:13,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:17:13,124 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:17:13,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13 WrapperNode [2024-09-20 12:17:13,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:17:13,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:17:13,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:17:13,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:17:13,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,157 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:17:13,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:17:13,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:17:13,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:17:13,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:17:13,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,202 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 12:17:13,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:17:13,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:17:13,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:17:13,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:17:13,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (1/1) ... [2024-09-20 12:17:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:17:13,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:17:13,275 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 12:17:13,289 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 12:17:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:17:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-20 12:17:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-20 12:17:13,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-09-20 12:17:13,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 12:17:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 12:17:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:17:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:17:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-20 12:17:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-20 12:17:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:17:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-20 12:17:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-20 12:17:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:17:13,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:17:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 12:17:13,341 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 12:17:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 12:17:13,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 12:17:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 12:17:13,447 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:17:13,450 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:17:13,732 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-20 12:17:13,732 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:17:13,755 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:17:13,755 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 12:17:13,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:17:13 BoogieIcfgContainer [2024-09-20 12:17:13,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:17:13,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:17:13,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:17:13,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:17:13,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:17:12" (1/3) ... [2024-09-20 12:17:13,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49170ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:17:13, skipping insertion in model container [2024-09-20 12:17:13,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:17:13" (2/3) ... [2024-09-20 12:17:13,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49170ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:17:13, skipping insertion in model container [2024-09-20 12:17:13,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:17:13" (3/3) ... [2024-09-20 12:17:13,764 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-20 12:17:13,779 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:17:13,780 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:17:13,835 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:17:13,842 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;@459c55af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:17:13,842 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:17:13,846 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 12:17:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 12:17:13,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:13,854 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 12:17:13,855 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:13,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-20 12:17:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:17:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335366576] [2024-09-20 12:17:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:13,876 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 12:17:13,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:17:13,882 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 12:17:13,893 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 12:17:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:14,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-20 12:17:14,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:14,065 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 12:17:14,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:17:14,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:17:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335366576] [2024-09-20 12:17:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335366576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:17:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266215934] [2024-09-20 12:17:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:14,076 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:17:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:17:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:17:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:17:14,102 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 12:17:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:14,142 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-20 12:17:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:17:14,145 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 12:17:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:14,152 INFO L225 Difference]: With dead ends: 82 [2024-09-20 12:17:14,153 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 12:17:14,157 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 12:17:14,161 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 12:17:14,162 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 12:17:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 12:17:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-20 12:17:14,204 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 12:17:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-20 12:17:14,209 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-20 12:17:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:14,210 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-20 12:17:14,211 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 12:17:14,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-20 12:17:14,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 12:17:14,215 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:14,215 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 12:17:14,223 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 12:17:14,416 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 12:17:14,417 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-20 12:17:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:17:14,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797328658] [2024-09-20 12:17:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:14,420 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 12:17:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:17:14,424 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 12:17:14,436 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 12:17:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:14,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 12:17:14,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:14,681 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 12:17:14,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:17:14,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:17:14,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797328658] [2024-09-20 12:17:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797328658] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:17:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:17:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-20 12:17:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436776631] [2024-09-20 12:17:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:17:14,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:17:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:17:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:17:14,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:17:14,686 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 12:17:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:14,850 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-20 12:17:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 12:17:14,853 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 12:17:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:14,855 INFO L225 Difference]: With dead ends: 58 [2024-09-20 12:17:14,855 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 12:17:14,857 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 12:17:14,858 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 12:17:14,858 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 12:17:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 12:17:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 12:17:14,865 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 12:17:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-20 12:17:14,866 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 40 [2024-09-20 12:17:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:14,868 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-20 12:17:14,868 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 12:17:14,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-20 12:17:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 12:17:14,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:14,870 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 12:17:14,875 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-20 12:17:15,070 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 12:17:15,072 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:15,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 46925806, now seen corresponding path program 1 times [2024-09-20 12:17:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:17:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659827796] [2024-09-20 12:17:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:15,074 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 12:17:15,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:17:15,076 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 12:17:15,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 (4)] Waiting until timeout for monitored process [2024-09-20 12:17:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:15,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-20 12:17:15,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:15,922 INFO L349 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2024-09-20 12:17:15,923 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 12:17:16,034 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 12:17:16,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:24,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:17:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659827796] [2024-09-20 12:17:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659827796] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:17:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136867819] [2024-09-20 12:17:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:24,452 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 12:17:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 12:17:24,455 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 12:17:24,456 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 12:17:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:17:24,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 12:17:24,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:24,646 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 12:17:28,857 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 12:17:32,983 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 12:17:49,986 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 12:17:49,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:18:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2136867819] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:18:10,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:18:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2024-09-20 12:18:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088822337] [2024-09-20 12:18:10,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:18:10,339 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-20 12:18:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:18:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-20 12:18:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=798, Unknown=13, NotChecked=114, Total=992 [2024-09-20 12:18:10,341 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 12:18:54,516 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 12:18:58,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 12:19:19,796 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 12:19:23,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 12:20:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:20:05,797 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-20 12:20:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-20 12:20:05,798 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 12:20:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:20:05,801 INFO L225 Difference]: With dead ends: 89 [2024-09-20 12:20:05,801 INFO L226 Difference]: Without dead ends: 66 [2024-09-20 12:20:05,803 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 152.3s TimeCoverageRelationStatistics Valid=254, Invalid=2914, Unknown=32, NotChecked=222, Total=3422 [2024-09-20 12:20:05,804 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-09-20 12:20:05,804 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 385 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 618 Invalid, 4 Unknown, 149 Unchecked, 17.3s Time] [2024-09-20 12:20:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-20 12:20:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-09-20 12:20:05,827 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 12:20:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-20 12:20:05,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 43 [2024-09-20 12:20:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:20:05,829 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-20 12:20:05,829 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 12:20:05,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:20:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-20 12:20:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-20 12:20:05,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:20:05,831 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 12:20:05,837 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 12:20:06,034 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-09-20 12:20:06,231 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 12:20:06,232 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:20:06,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:20:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1935896750, now seen corresponding path program 1 times [2024-09-20 12:20:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:20:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891985188] [2024-09-20 12:20:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:20:06,234 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 12:20:06,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:20:06,235 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 12:20:06,237 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 12:20:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:20:06,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-20 12:20:06,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:20:06,308 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 12:20:06,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 12:20:06,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:20:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891985188] [2024-09-20 12:20:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891985188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:20:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:20:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:20:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633398173] [2024-09-20 12:20:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:20:06,310 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:20:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:20:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:20:06,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:20:06,311 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 12:20:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:20:06,361 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-09-20 12:20:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:20:06,361 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 12:20:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:20:06,364 INFO L225 Difference]: With dead ends: 87 [2024-09-20 12:20:06,364 INFO L226 Difference]: Without dead ends: 61 [2024-09-20 12:20:06,366 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 12:20:06,368 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 12:20:06,370 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 12:20:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-20 12:20:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-20 12:20:06,395 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 12:20:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-09-20 12:20:06,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 43 [2024-09-20 12:20:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:20:06,401 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-09-20 12:20:06,401 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 12:20:06,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:20:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-09-20 12:20:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 12:20:06,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:20:06,405 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 12:20:06,417 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-09-20 12:20:06,606 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 12:20:06,606 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:20:06,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:20:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 204017195, now seen corresponding path program 1 times [2024-09-20 12:20:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:20:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649991186] [2024-09-20 12:20:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:20:06,608 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 12:20:06,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:20:06,611 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 12:20:06,615 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 12:20:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:20:06,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-20 12:20:06,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:20:10,488 INFO L349 Elim1Store]: treesize reduction 104, result has 39.9 percent of original size [2024-09-20 12:20:10,489 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 12:20:10,884 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 12:20:10,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:20:19,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:20:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649991186] [2024-09-20 12:20:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649991186] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:20:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1609920417] [2024-09-20 12:20:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:20:19,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 12:20:19,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 12:20:19,513 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 12:20:19,514 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 12:20:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:20:19,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-20 12:20:19,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:20:19,629 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 12:20:23,977 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 12:20:28,128 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 12:20:32,504 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 12:20:32,655 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 12:20:32,819 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 12:20:32,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:20:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1609920417] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:20:57,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:20:57,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-20 12:20:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817946987] [2024-09-20 12:20:57,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:20:57,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-20 12:20:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:20:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-20 12:20:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1106, Unknown=11, NotChecked=204, Total=1406 [2024-09-20 12:20:57,204 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 12:21:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:21:28,202 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-09-20 12:21:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-20 12:21:28,204 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 12:21:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:21:28,205 INFO L225 Difference]: With dead ends: 87 [2024-09-20 12:21:28,205 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 12:21:28,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=224, Invalid=2965, Unknown=15, NotChecked=336, Total=3540 [2024-09-20 12:21:28,207 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.4s IncrementalHoareTripleChecker+Time [2024-09-20 12:21:28,208 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.4s Time] [2024-09-20 12:21:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 12:21:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-09-20 12:21:28,226 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 12:21:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-20 12:21:28,227 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2024-09-20 12:21:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:21:28,227 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-20 12:21:28,227 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 12:21:28,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:21:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-20 12:21:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 12:21:28,229 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:21:28,229 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 12:21:28,235 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-09-20 12:21:28,433 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 12:21:28,630 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 12:21:28,631 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:21:28,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:21:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-20 12:21:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 12:21:28,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291157279] [2024-09-20 12:21:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:21:28,632 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 12:21:28,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 12:21:28,635 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 12:21:28,639 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 12:21:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:21:28,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-20 12:21:28,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:21:30,270 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 12:21:30,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:21:32,252 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 12:21:32,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 12:21:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291157279] [2024-09-20 12:21:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291157279] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:21:32,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 12:21:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-09-20 12:21:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25756370] [2024-09-20 12:21:32,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 12:21:32,254 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-20 12:21:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 12:21:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-20 12:21:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-09-20 12:21:32,255 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)