./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/duplets.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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:37:24,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:37:25,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:37:25,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:37:25,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:37:25,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:37:25,121 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:37:25,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:37:25,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:37:25,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:37:25,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:37:25,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:37:25,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:37:25,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:37:25,128 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:37:25,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:37:25,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:37:25,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:37:25,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:37:25,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:37:25,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:37:25,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:37:25,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:37:25,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:37:25,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:37:25,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:37:25,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:37:25,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:37:25,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:37:25,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:37:25,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:37:25,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:37:25,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:37:25,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:37:25,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:37:25,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:37:25,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:37:25,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:37:25,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:37:25,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:37:25,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:37:25,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:37:25,140 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:37:25,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:37:25,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:37:25,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:37:25,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:37:25,513 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:37:25,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-25 10:37:26,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:37:27,196 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:37:27,196 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-25 10:37:27,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a7990c01a/0df92d492638456f91c997e002ebf836/FLAGafe20f336 [2024-09-25 10:37:27,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a7990c01a/0df92d492638456f91c997e002ebf836 [2024-09-25 10:37:27,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:37:27,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:37:27,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:37:27,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:37:27,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:37:27,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ef3a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27, skipping insertion in model container [2024-09-25 10:37:27,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:37:27,401 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/duplets.c[485,498] [2024-09-25 10:37:27,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:37:27,452 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:37:27,462 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/duplets.c[485,498] [2024-09-25 10:37:27,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:37:27,499 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:37:27,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27 WrapperNode [2024-09-25 10:37:27,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:37:27,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:37:27,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:37:27,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:37:27,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,534 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:37:27,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:37:27,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:37:27,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:37:27,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:37:27,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,575 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-09-25 10:37:27,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:37:27,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:37:27,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:37:27,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:37:27,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (1/1) ... [2024-09-25 10:37:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:37:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:27,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:37:27,649 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:37:27,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:37:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-09-25 10:37:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-09-25 10:37:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:37:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:37:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:37:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:37:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:37:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 10:37:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 10:37:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 10:37:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 10:37:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 10:37:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 10:37:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 10:37:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 10:37:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:37:27,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:37:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 10:37:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-09-25 10:37:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-09-25 10:37:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:37:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:37:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 10:37:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 10:37:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 10:37:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 10:37:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 10:37:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 10:37:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:37:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:37:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 10:37:27,821 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:37:27,824 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:37:28,089 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-25 10:37:28,089 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:37:28,123 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:37:28,123 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:37:28,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:37:28 BoogieIcfgContainer [2024-09-25 10:37:28,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:37:28,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:37:28,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:37:28,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:37:28,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:37:27" (1/3) ... [2024-09-25 10:37:28,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:37:28, skipping insertion in model container [2024-09-25 10:37:28,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:37:27" (2/3) ... [2024-09-25 10:37:28,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:37:28, skipping insertion in model container [2024-09-25 10:37:28,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:37:28" (3/3) ... [2024-09-25 10:37:28,137 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-25 10:37:28,155 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:37:28,156 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:37:28,233 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:37:28,241 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;@722a9673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:37:28,242 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:37:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-25 10:37:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:37:28,255 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:28,255 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:28,256 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:28,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-09-25 10:37:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468346070] [2024-09-25 10:37:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468346070] [2024-09-25 10:37:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468346070] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:37:28,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:37:28,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:37:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414315345] [2024-09-25 10:37:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:28,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:37:28,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:28,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:37:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:37:28,591 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 10:37:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:28,899 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-09-25 10:37:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:37:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 46 [2024-09-25 10:37:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:28,925 INFO L225 Difference]: With dead ends: 118 [2024-09-25 10:37:28,925 INFO L226 Difference]: Without dead ends: 64 [2024-09-25 10:37:28,928 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:37:28,934 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:28,936 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 32 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:37:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-25 10:37:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-09-25 10:37:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:37:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-25 10:37:29,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-09-25 10:37:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:29,012 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-25 10:37:29,012 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 10:37:29,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-25 10:37:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 10:37:29,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:29,016 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:29,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:37:29,017 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:29,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-09-25 10:37:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491910674] [2024-09-25 10:37:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491910674] [2024-09-25 10:37:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491910674] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:29,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552114339] [2024-09-25 10:37:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:29,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:29,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:37:29,726 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:37:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:29,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:37:29,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:29,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:30,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552114339] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:30,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:30,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-09-25 10:37:30,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314166031] [2024-09-25 10:37:30,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:30,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:37:30,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:37:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:37:30,331 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-25 10:37:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:30,950 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-09-25 10:37:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 10:37:30,951 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2024-09-25 10:37:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:30,952 INFO L225 Difference]: With dead ends: 99 [2024-09-25 10:37:30,952 INFO L226 Difference]: Without dead ends: 78 [2024-09-25 10:37:30,953 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-09-25 10:37:30,955 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 94 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:30,956 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 396 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:37:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-25 10:37:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-09-25 10:37:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:37:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-09-25 10:37:30,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-09-25 10:37:30,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:30,971 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-09-25 10:37:30,971 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 8 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-25 10:37:30,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-09-25 10:37:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-25 10:37:30,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:30,973 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:30,991 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:37:31,177 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:31,178 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:31,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-09-25 10:37:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863429168] [2024-09-25 10:37:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:31,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863429168] [2024-09-25 10:37:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863429168] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:37:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:37:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:37:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258229009] [2024-09-25 10:37:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:31,352 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:37:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:37:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:37:31,353 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:37:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:31,663 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-09-25 10:37:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:37:31,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 47 [2024-09-25 10:37:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:31,665 INFO L225 Difference]: With dead ends: 71 [2024-09-25 10:37:31,665 INFO L226 Difference]: Without dead ends: 69 [2024-09-25 10:37:31,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:37:31,666 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 74 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:31,667 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 185 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:37:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-25 10:37:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-25 10:37:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-25 10:37:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-25 10:37:31,685 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-09-25 10:37:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:31,687 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-25 10:37:31,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:37:31,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-25 10:37:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 10:37:31,691 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:31,691 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:31,691 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:37:31,691 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:31,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-09-25 10:37:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939848486] [2024-09-25 10:37:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:31,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:31,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:32,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939848486] [2024-09-25 10:37:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939848486] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387058594] [2024-09-25 10:37:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:32,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:32,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:37:32,361 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:37:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:32,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-25 10:37:32,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:32,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:33,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387058594] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:33,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:37:33,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-09-25 10:37:33,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708999567] [2024-09-25 10:37:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:33,233 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:37:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:37:33,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-09-25 10:37:33,235 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-25 10:37:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:33,423 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-09-25 10:37:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:37:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2024-09-25 10:37:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:33,427 INFO L225 Difference]: With dead ends: 101 [2024-09-25 10:37:33,427 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 10:37:33,429 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-09-25 10:37:33,431 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:33,431 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 406 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:37:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 10:37:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-25 10:37:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-25 10:37:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-09-25 10:37:33,449 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-09-25 10:37:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:33,451 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-09-25 10:37:33,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-25 10:37:33,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-09-25 10:37:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 10:37:33,452 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:33,453 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:33,471 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:37:33,653 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:33,654 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:33,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-09-25 10:37:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116379222] [2024-09-25 10:37:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116379222] [2024-09-25 10:37:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116379222] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625608630] [2024-09-25 10:37:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:33,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:33,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:37:33,767 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:37:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:33,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:37:33,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:33,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:33,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625608630] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:33,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:33,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-25 10:37:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562994315] [2024-09-25 10:37:33,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:33,926 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:37:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:37:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:37:33,928 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:37:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:34,162 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-09-25 10:37:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:37:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-09-25 10:37:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:34,163 INFO L225 Difference]: With dead ends: 94 [2024-09-25 10:37:34,164 INFO L226 Difference]: Without dead ends: 73 [2024-09-25 10:37:34,164 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:37:34,165 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:34,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 118 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:37:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-25 10:37:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-09-25 10:37:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-25 10:37:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-09-25 10:37:34,176 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-09-25 10:37:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:34,176 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-09-25 10:37:34,177 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:37:34,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-09-25 10:37:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:37:34,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:34,181 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2024-09-25 10:37:34,198 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:37:34,382 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:34,382 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:34,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-09-25 10:37:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:34,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159587094] [2024-09-25 10:37:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 10:37:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:37:34,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:34,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159587094] [2024-09-25 10:37:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159587094] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:37:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:37:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-25 10:37:34,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636011451] [2024-09-25 10:37:34,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:37:34,795 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:37:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:37:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:37:34,796 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-25 10:37:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:37:35,349 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-09-25 10:37:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 10:37:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-09-25 10:37:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:37:35,351 INFO L225 Difference]: With dead ends: 107 [2024-09-25 10:37:35,351 INFO L226 Difference]: Without dead ends: 93 [2024-09-25 10:37:35,352 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:37:35,353 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 86 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:37:35,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 204 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:37:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-25 10:37:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-09-25 10:37:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.1875) internal successors, (57), 51 states have internal predecessors, (57), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-25 10:37:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-09-25 10:37:35,383 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-09-25 10:37:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:37:35,383 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-09-25 10:37:35,383 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-25 10:37:35,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-09-25 10:37:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 10:37:35,385 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:37:35,385 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:37:35,385 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:37:35,386 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:37:35,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:37:35,386 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-09-25 10:37:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:37:35,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575622451] [2024-09-25 10:37:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:37:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:37:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:37:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:37:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:37:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:37:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:37:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:37:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:36,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:37:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:37:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-25 10:37:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:37:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575622451] [2024-09-25 10:37:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575622451] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111731054] [2024-09-25 10:37:37,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:37:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:37:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:37:37,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:37:37,192 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:37:37,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:37:37,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:37:37,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-25 10:37:37,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:37:37,524 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-25 10:37:37,525 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 1 case distinctions, treesize of input 38 treesize of output 19 [2024-09-25 10:37:41,726 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_mkdup_~i~0_30 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int) (v_mkdup_~j~0_34 Int)) (and (let ((.cse0 (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_1))) (= (select .cse0 (+ (* v_mkdup_~i~0_30 4) v_main_~a~0.offset_BEFORE_CALL_1)) (select .cse0 (+ (* v_mkdup_~j~0_34 4) v_main_~a~0.offset_BEFORE_CALL_1)))) (not (= v_mkdup_~i~0_30 v_mkdup_~j~0_34)) (<= 0 v_mkdup_~i~0_30) (<= 0 v_mkdup_~j~0_34))) is different from true [2024-09-25 10:37:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:37:42,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111731054] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:37:42,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:37:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2024-09-25 10:37:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352030714] [2024-09-25 10:37:42,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:42,671 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-25 10:37:42,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-25 10:37:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1106, Unknown=1, NotChecked=66, Total=1260 [2024-09-25 10:37:42,673 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 10:40:34,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 10:40:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:34,557 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2024-09-25 10:40:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-25 10:40:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 54 [2024-09-25 10:40:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:34,560 INFO L225 Difference]: With dead ends: 167 [2024-09-25 10:40:34,560 INFO L226 Difference]: Without dead ends: 111 [2024-09-25 10:40:34,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 170.8s TimeCoverageRelationStatistics Valid=376, Invalid=4009, Unknown=41, NotChecked=130, Total=4556 [2024-09-25 10:40:34,562 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 247 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:34,563 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 562 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2135 Invalid, 1 Unknown, 152 Unchecked, 6.2s Time] [2024-09-25 10:40:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-25 10:40:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-09-25 10:40:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-25 10:40:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-25 10:40:34,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-09-25 10:40:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:34,583 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-25 10:40:34,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 12 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 10:40:34,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-25 10:40:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:40:34,585 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:34,585 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-09-25 10:40:34,603 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:40:34,789 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:34,790 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:34,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-09-25 10:40:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885832034] [2024-09-25 10:40:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,969 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:34,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 10:40:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:40:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885832034] [2024-09-25 10:40:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885832034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:40:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:40:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-25 10:40:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816120520] [2024-09-25 10:40:35,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:40:35,056 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:40:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:40:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:40:35,057 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 10:40:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:35,508 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-09-25 10:40:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:40:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-09-25 10:40:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:35,510 INFO L225 Difference]: With dead ends: 100 [2024-09-25 10:40:35,510 INFO L226 Difference]: Without dead ends: 98 [2024-09-25 10:40:35,511 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:40:35,511 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:35,511 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:40:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-25 10:40:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-09-25 10:40:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 62 states have internal predecessors, (71), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-25 10:40:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-09-25 10:40:35,542 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-09-25 10:40:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:35,542 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-09-25 10:40:35,542 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 10:40:35,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-09-25 10:40:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:40:35,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:35,545 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-09-25 10:40:35,545 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 10:40:35,545 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:35,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-09-25 10:40:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255531729] [2024-09-25 10:40:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 10:40:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:40:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:35,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255531729] [2024-09-25 10:40:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255531729] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:40:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:40:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:40:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679744758] [2024-09-25 10:40:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:40:35,799 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:40:35,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:40:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:40:35,801 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 10:40:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:36,142 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-25 10:40:36,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:40:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 61 [2024-09-25 10:40:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:36,145 INFO L225 Difference]: With dead ends: 105 [2024-09-25 10:40:36,145 INFO L226 Difference]: Without dead ends: 94 [2024-09-25 10:40:36,145 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:40:36,146 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 65 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:36,146 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 140 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:40:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-25 10:40:36,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-25 10:40:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 62 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-25 10:40:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-25 10:40:36,169 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-09-25 10:40:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:36,170 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-25 10:40:36,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 10:40:36,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-25 10:40:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-25 10:40:36,171 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:36,171 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-09-25 10:40:36,174 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-25 10:40:36,174 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:36,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-09-25 10:40:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:36,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576526368] [2024-09-25 10:40:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:40:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576526368] [2024-09-25 10:40:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576526368] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707085643] [2024-09-25 10:40:36,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:40:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:36,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:36,298 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:40:36,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:40:36,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:36,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:40:36,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-25 10:40:36,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:40:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707085643] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:40:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:40:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-09-25 10:40:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717793429] [2024-09-25 10:40:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:40:36,429 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:40:36,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:40:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:40:36,430 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:40:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:36,482 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-09-25 10:40:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:40:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2024-09-25 10:40:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:36,484 INFO L225 Difference]: With dead ends: 140 [2024-09-25 10:40:36,484 INFO L226 Difference]: Without dead ends: 92 [2024-09-25 10:40:36,484 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:40:36,485 INFO L434 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:36,485 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:40:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-25 10:40:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-09-25 10:40:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 63 states have internal predecessors, (70), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-25 10:40:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-09-25 10:40:36,520 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-09-25 10:40:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:36,520 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-09-25 10:40:36,520 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-25 10:40:36,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-09-25 10:40:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:40:36,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:36,522 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:36,538 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:40:36,722 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:40:36,723 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:36,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:36,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-09-25 10:40:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:36,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717795794] [2024-09-25 10:40:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:36,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:40:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717795794] [2024-09-25 10:40:37,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717795794] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130586978] [2024-09-25 10:40:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:37,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:37,128 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:40:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:37,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 10:40:37,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:37,337 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 15 treesize of output 1 [2024-09-25 10:40:37,391 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 17 treesize of output 9 [2024-09-25 10:40:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:40:37,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:37,568 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 28 treesize of output 24 [2024-09-25 10:40:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:40:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130586978] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:40:37,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:40:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-09-25 10:40:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949961203] [2024-09-25 10:40:37,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:37,689 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 10:40:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:37,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 10:40:37,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-09-25 10:40:37,690 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-25 10:40:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:38,430 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-09-25 10:40:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 10:40:38,430 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 61 [2024-09-25 10:40:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:38,431 INFO L225 Difference]: With dead ends: 129 [2024-09-25 10:40:38,431 INFO L226 Difference]: Without dead ends: 106 [2024-09-25 10:40:38,432 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 10:40:38,432 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:38,433 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:40:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-25 10:40:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-09-25 10:40:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 65 states have internal predecessors, (74), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-09-25 10:40:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-09-25 10:40:38,456 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-09-25 10:40:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:38,456 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-09-25 10:40:38,457 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 19 states have internal predecessors, (52), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-25 10:40:38,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-09-25 10:40:38,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:40:38,458 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:38,458 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:40:38,474 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:40:38,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:40:38,659 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:38,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:38,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-09-25 10:40:38,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:38,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628885] [2024-09-25 10:40:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:38,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,765 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:40:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:38,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 10:40:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628885] [2024-09-25 10:40:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628885] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:40:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:40:38,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-25 10:40:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673629851] [2024-09-25 10:40:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:40:38,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:40:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:38,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:40:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:40:38,872 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-25 10:40:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:40:39,247 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-09-25 10:40:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 10:40:39,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2024-09-25 10:40:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:40:39,248 INFO L225 Difference]: With dead ends: 122 [2024-09-25 10:40:39,248 INFO L226 Difference]: Without dead ends: 104 [2024-09-25 10:40:39,248 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:40:39,249 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:40:39,249 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 199 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:40:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-25 10:40:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-25 10:40:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2024-09-25 10:40:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-09-25 10:40:39,270 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-09-25 10:40:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:40:39,270 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-09-25 10:40:39,271 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-25 10:40:39,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-09-25 10:40:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 10:40:39,272 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:40:39,272 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1] [2024-09-25 10:40:39,272 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 10:40:39,272 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:40:39,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:40:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-09-25 10:40:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:40:39,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78274497] [2024-09-25 10:40:39,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:40:39,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:40:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:40:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:40:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:40:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:40:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:40:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:40:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:40,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:40:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:40:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:40:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:40:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78274497] [2024-09-25 10:40:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78274497] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877244039] [2024-09-25 10:40:42,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:40:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:40:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:40:42,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:40:42,285 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:40:42,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:40:42,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:40:42,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-09-25 10:40:42,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:40:42,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 10:40:42,631 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~j~0_39 Int) (v_mkdup_~i~0_35 Int)) (and (<= (+ v_mkdup_~j~0_39 1) |c_mkdup_#in~n|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_39 4) |c_mkdup_#in~a.offset|))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* v_mkdup_~i~0_35 4)) .cse0) .cse1 .cse0))))) (<= 0 v_mkdup_~j~0_39))) is different from true [2024-09-25 10:40:42,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 32 [2024-09-25 10:40:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:40:43,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:40:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877244039] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:40:45,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:40:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2024-09-25 10:40:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391437342] [2024-09-25 10:40:45,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:40:45,022 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-25 10:40:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:40:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-25 10:40:45,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2614, Unknown=1, NotChecked=104, Total=2970 [2024-09-25 10:40:45,024 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-25 10:41:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:41:03,301 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-09-25 10:41:03,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-25 10:41:03,302 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 61 [2024-09-25 10:41:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:41:03,303 INFO L225 Difference]: With dead ends: 163 [2024-09-25 10:41:03,303 INFO L226 Difference]: Without dead ends: 83 [2024-09-25 10:41:03,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=1822, Invalid=12461, Unknown=1, NotChecked=236, Total=14520 [2024-09-25 10:41:03,306 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 325 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-09-25 10:41:03,307 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 224 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1784 Invalid, 0 Unknown, 141 Unchecked, 1.9s Time] [2024-09-25 10:41:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-25 10:41:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-09-25 10:41:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 54 states have internal predecessors, (60), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:41:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-09-25 10:41:03,338 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 61 [2024-09-25 10:41:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:41:03,338 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-09-25 10:41:03,339 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-25 10:41:03,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-09-25 10:41:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-25 10:41:03,340 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:41:03,341 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:41:03,355 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:41:03,541 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:41:03,542 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:41:03,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1375399225, now seen corresponding path program 1 times [2024-09-25 10:41:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:41:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243688284] [2024-09-25 10:41:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:41:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:41:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:41:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:41:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:41:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:41:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:41:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 10:41:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:41:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:41:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:41:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:41:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243688284] [2024-09-25 10:41:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243688284] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:41:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:41:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-25 10:41:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265422545] [2024-09-25 10:41:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:41:03,868 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:41:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:41:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:41:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:41:03,869 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-25 10:41:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:41:04,204 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-09-25 10:41:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:41:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2024-09-25 10:41:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:41:04,205 INFO L225 Difference]: With dead ends: 97 [2024-09-25 10:41:04,205 INFO L226 Difference]: Without dead ends: 95 [2024-09-25 10:41:04,205 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:41:04,206 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:41:04,206 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 94 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:41:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-25 10:41:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-09-25 10:41:04,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2024-09-25 10:41:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-09-25 10:41:04,234 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 67 [2024-09-25 10:41:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:41:04,235 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-09-25 10:41:04,235 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-25 10:41:04,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-09-25 10:41:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-25 10:41:04,236 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:41:04,236 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:41:04,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-25 10:41:04,236 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:41:04,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2027329468, now seen corresponding path program 1 times [2024-09-25 10:41:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:41:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058430141] [2024-09-25 10:41:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:41:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:41:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:41:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:41:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:41:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:41:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:41:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 10:41:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-25 10:41:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 10:41:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:41:04,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:41:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058430141] [2024-09-25 10:41:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058430141] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:41:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941763902] [2024-09-25 10:41:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:04,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:41:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:41:04,589 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:41:04,592 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:41:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:04,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 10:41:04,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:41:04,754 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 15 treesize of output 1 [2024-09-25 10:41:04,758 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 15 treesize of output 1 [2024-09-25 10:41:13,026 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 21 treesize of output 13 [2024-09-25 10:41:13,028 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 17 treesize of output 9 [2024-09-25 10:41:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:41:13,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:41:13,217 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 52 treesize of output 48 [2024-09-25 10:41:13,222 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 82 treesize of output 74 [2024-09-25 10:41:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:41:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941763902] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:41:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:41:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 11] total 22 [2024-09-25 10:41:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471886273] [2024-09-25 10:41:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:41:13,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:41:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:41:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:41:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:41:13,329 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-25 10:41:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:41:17,535 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-09-25 10:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:41:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 69 [2024-09-25 10:41:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:41:17,536 INFO L225 Difference]: With dead ends: 100 [2024-09-25 10:41:17,536 INFO L226 Difference]: Without dead ends: 96 [2024-09-25 10:41:17,537 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=72, Invalid=479, Unknown=1, NotChecked=0, Total=552 [2024-09-25 10:41:17,537 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:41:17,537 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 346 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:41:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-25 10:41:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2024-09-25 10:41:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:41:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-09-25 10:41:17,565 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 69 [2024-09-25 10:41:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:41:17,565 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-09-25 10:41:17,566 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-25 10:41:17,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-09-25 10:41:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-25 10:41:17,566 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:41:17,567 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:41:17,583 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:41:17,767 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:41:17,767 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:41:17,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 219320101, now seen corresponding path program 1 times [2024-09-25 10:41:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:41:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329917104] [2024-09-25 10:41:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:41:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:41:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:41:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:41:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:41:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:41:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:41:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 10:41:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:41:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:41:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-25 10:41:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-25 10:41:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:41:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329917104] [2024-09-25 10:41:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329917104] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:41:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:41:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-09-25 10:41:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72887379] [2024-09-25 10:41:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:41:18,451 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:41:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:41:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:41:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:41:18,452 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 10:41:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:41:18,926 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-09-25 10:41:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:41:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 73 [2024-09-25 10:41:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:41:18,927 INFO L225 Difference]: With dead ends: 101 [2024-09-25 10:41:18,927 INFO L226 Difference]: Without dead ends: 83 [2024-09-25 10:41:18,928 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:41:18,928 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:41:18,928 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 127 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:41:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-25 10:41:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-09-25 10:41:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:41:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-09-25 10:41:18,961 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2024-09-25 10:41:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:41:18,961 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-09-25 10:41:18,962 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-25 10:41:18,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-09-25 10:41:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-25 10:41:18,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:41:18,963 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:41:18,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-25 10:41:18,963 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:41:18,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1185292379, now seen corresponding path program 1 times [2024-09-25 10:41:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:41:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131391904] [2024-09-25 10:41:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:41:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:41:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:41:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 10:41:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 10:41:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:41:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 10:41:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:41:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 10:41:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:41:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 10:41:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 10:41:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-25 10:41:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:41:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131391904] [2024-09-25 10:41:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131391904] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:41:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532982974] [2024-09-25 10:41:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:41:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:41:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:41:19,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:41:19,599 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:41:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:41:19,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-09-25 10:41:19,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:41:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 10:41:20,070 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_mkdup_~j~0_52 Int) (v_mkdup_~i~0_46 Int)) (and (<= (+ v_mkdup_~j~0_52 1) |c_mkdup_#in~n|) (<= 0 v_mkdup_~i~0_46) (<= (+ v_mkdup_~i~0_46 1) |c_mkdup_#in~n|) (<= 0 v_mkdup_~j~0_52) (= (store |c_old(#memory_int#1)| |c_mkdup_#in~a.base| (let ((.cse1 (+ (* v_mkdup_~j~0_52 4) |c_mkdup_#in~a.offset|))) (let ((.cse0 (select (select |c_#memory_int#1| |c_mkdup_#in~a.base|) .cse1))) (store (store (select |c_old(#memory_int#1)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* v_mkdup_~i~0_46 4)) .cse0) .cse1 .cse0)))) |c_#memory_int#1|) (not (= v_mkdup_~i~0_46 v_mkdup_~j~0_52)))) is different from true [2024-09-25 10:41:20,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 32 [2024-09-25 10:41:21,476 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 11 treesize of output 7 [2024-09-25 10:41:21,494 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 11 treesize of output 7 [2024-09-25 10:41:23,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 10:41:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 78 [2024-09-25 10:41:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-25 10:41:24,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:41:24,454 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 84 treesize of output 80 [2024-09-25 10:41:24,457 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 138 treesize of output 130 [2024-09-25 10:41:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-25 10:41:28,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532982974] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:41:28,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:41:28,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 17] total 52 [2024-09-25 10:41:28,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385573712] [2024-09-25 10:41:28,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:41:28,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-25 10:41:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:41:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-25 10:41:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2293, Unknown=2, NotChecked=98, Total=2652 [2024-09-25 10:41:28,073 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-09-25 10:41:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:41:33,228 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-09-25 10:41:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-25 10:41:33,228 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 80 [2024-09-25 10:41:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:41:33,229 INFO L225 Difference]: With dead ends: 116 [2024-09-25 10:41:33,229 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:41:33,230 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=794, Invalid=7763, Unknown=3, NotChecked=182, Total=8742 [2024-09-25 10:41:33,231 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:41:33,231 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 233 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1471 Invalid, 1 Unknown, 96 Unchecked, 2.1s Time] [2024-09-25 10:41:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:41:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:41:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:41:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:41:33,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-09-25 10:41:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:41:33,232 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:41:33,232 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 13 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2024-09-25 10:41:33,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:41:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:41:33,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:41:33,235 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:41:33,249 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-25 10:41:33,439 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-25 10:41:33,443 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:41:33,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.