./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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:00:50,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:00:50,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:00:50,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:00:50,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:00:50,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:00:50,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:00:50,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:00:50,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:00:50,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:00:50,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:00:50,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:00:50,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:00:50,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:00:50,547 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:00:50,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:00:50,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:00:50,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:00:50,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:00:50,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:00:50,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:00:50,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:00:50,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:00:50,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:00:50,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:00:50,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:00:50,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:00:50,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:00:50,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:00:50,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:00:50,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:00:50,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:00:50,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:00:50,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:00:50,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:00:50,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:00:50,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:00:50,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:00:50,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:00:50,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:00:50,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:00:50,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:00:50,554 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:00:50,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:00:50,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:00:50,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:00:50,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:00:50,801 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:00:50,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/duplets.c [2024-09-20 19:00:52,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:00:52,393 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:00:52,394 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/duplets.c [2024-09-20 19:00:52,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5629476df/f3c94f3a7a0547b8a03b03e23f6e60ea/FLAGb8038074e [2024-09-20 19:00:52,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5629476df/f3c94f3a7a0547b8a03b03e23f6e60ea [2024-09-20 19:00:52,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:00:52,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:00:52,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:00:52,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:00:52,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:00:52,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccbf627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:52, skipping insertion in model container [2024-09-20 19:00:52,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:00:52" (1/1) ... [2024-09-20 19:00:52,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:00:52,980 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-20 19:00:53,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:00:53,034 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:00:53,045 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-20 19:00:53,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:00:53,083 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:00:53,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53 WrapperNode [2024-09-20 19:00:53,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:00:53,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:00:53,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:00:53,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:00:53,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,116 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:00:53,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:00:53,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:00:53,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:00:53,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:00:53,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,152 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-20 19:00:53,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:00:53,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:00:53,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:00:53,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:00:53,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (1/1) ... [2024-09-20 19:00:53,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:00:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:53,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 19:00:53,214 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 19:00:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:00:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2024-09-20 19:00:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2024-09-20 19:00:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:00:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:00:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-20 19:00:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 19:00:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 19:00:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 19:00:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-20 19:00:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-20 19:00:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:00:53,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:00:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 19:00:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2024-09-20 19:00:53,255 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2024-09-20 19:00:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:00:53,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:00:53,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 19:00:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 19:00:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 19:00:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-20 19:00:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 19:00:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 19:00:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:00:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:00:53,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 19:00:53,340 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:00:53,341 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:00:53,624 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-09-20 19:00:53,624 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:00:53,644 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:00:53,645 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 19:00:53,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:00:53 BoogieIcfgContainer [2024-09-20 19:00:53,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:00:53,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:00:53,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:00:53,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:00:53,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:00:52" (1/3) ... [2024-09-20 19:00:53,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6736b8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:00:53, skipping insertion in model container [2024-09-20 19:00:53,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:00:53" (2/3) ... [2024-09-20 19:00:53,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6736b8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:00:53, skipping insertion in model container [2024-09-20 19:00:53,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:00:53" (3/3) ... [2024-09-20 19:00:53,655 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-09-20 19:00:53,671 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:00:53,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:00:53,714 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:00:53,719 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;@58bdbe12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:00:53,720 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:00:53,725 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-20 19:00:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 19:00:53,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:53,734 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-20 19:00:53,734 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:53,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:53,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1311007902, now seen corresponding path program 1 times [2024-09-20 19:00:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723747462] [2024-09-20 19:00:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:53,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,075 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-20 19:00:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723747462] [2024-09-20 19:00:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723747462] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:54,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 19:00:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723498156] [2024-09-20 19:00:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:54,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 19:00:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 19:00:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 19:00:54,109 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-20 19:00:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:54,374 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2024-09-20 19:00:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:00:54,377 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-20 19:00:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:54,384 INFO L225 Difference]: With dead ends: 118 [2024-09-20 19:00:54,385 INFO L226 Difference]: Without dead ends: 64 [2024-09-20 19:00:54,390 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-20 19:00:54,393 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:00:54,394 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.2s Time] [2024-09-20 19:00:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-20 19:00:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-09-20 19:00:54,442 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-20 19:00:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-20 19:00:54,446 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 46 [2024-09-20 19:00:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:54,446 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-20 19:00:54,447 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-20 19:00:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-20 19:00:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 19:00:54,449 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:54,450 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-20 19:00:54,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:00:54,450 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:54,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1692327078, now seen corresponding path program 1 times [2024-09-20 19:00:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426886900] [2024-09-20 19:00:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:54,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,021 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-20 19:00:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426886900] [2024-09-20 19:00:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426886900] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778695067] [2024-09-20 19:00:55,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:00:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:55,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 19:00:55,028 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 19:00:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:55,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 19:00:55,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:00:55,251 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-20 19:00:55,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:00:55,580 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-20 19:00:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778695067] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:00:55,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:00:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-09-20 19:00:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311301810] [2024-09-20 19:00:55,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:00:55,583 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 19:00:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 19:00:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:00:55,587 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-20 19:00:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:56,252 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2024-09-20 19:00:56,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 19:00:56,253 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-20 19:00:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:56,255 INFO L225 Difference]: With dead ends: 99 [2024-09-20 19:00:56,255 INFO L226 Difference]: Without dead ends: 78 [2024-09-20 19:00:56,256 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-20 19:00:56,257 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 94 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-20 19:00:56,257 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.5s Time] [2024-09-20 19:00:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-20 19:00:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2024-09-20 19:00:56,269 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-20 19:00:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-09-20 19:00:56,273 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 46 [2024-09-20 19:00:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:56,274 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-09-20 19:00:56,276 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-20 19:00:56,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-09-20 19:00:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 19:00:56,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:56,278 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-20 19:00:56,296 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:00:56,479 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-20 19:00:56,479 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:56,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:56,480 INFO L85 PathProgramCache]: Analyzing trace with hash -762329273, now seen corresponding path program 1 times [2024-09-20 19:00:56,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424223499] [2024-09-20 19:00:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:56,632 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-20 19:00:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424223499] [2024-09-20 19:00:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424223499] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 19:00:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864765229] [2024-09-20 19:00:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:56,633 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 19:00:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 19:00:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:00:56,635 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-20 19:00:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:56,939 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-09-20 19:00:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:00:56,939 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-20 19:00:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:56,941 INFO L225 Difference]: With dead ends: 71 [2024-09-20 19:00:56,941 INFO L226 Difference]: Without dead ends: 69 [2024-09-20 19:00:56,941 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-20 19:00:56,942 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-20 19:00:56,944 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-20 19:00:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-20 19:00:56,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-09-20 19:00:56,960 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-20 19:00:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-20 19:00:56,963 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 47 [2024-09-20 19:00:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:56,963 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-20 19:00:56,964 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-20 19:00:56,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-20 19:00:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-20 19:00:56,965 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:56,965 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-20 19:00:56,965 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 19:00:56,966 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:56,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1192301050, now seen corresponding path program 1 times [2024-09-20 19:00:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473957278] [2024-09-20 19:00:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,608 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-20 19:00:57,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:57,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473957278] [2024-09-20 19:00:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473957278] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:57,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63876325] [2024-09-20 19:00:57,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:00:57,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:57,615 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-20 19:00:57,616 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-20 19:00:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:57,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-20 19:00:57,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:00:57,899 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-20 19:00:57,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:00:58,377 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-20 19:00:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63876325] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:58,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:00:58,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16, 12] total 27 [2024-09-20 19:00:58,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680797067] [2024-09-20 19:00:58,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:58,379 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 19:00:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 19:00:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-09-20 19:00:58,381 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-20 19:00:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:58,545 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2024-09-20 19:00:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 19:00:58,546 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-20 19:00:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:58,550 INFO L225 Difference]: With dead ends: 101 [2024-09-20 19:00:58,551 INFO L226 Difference]: Without dead ends: 68 [2024-09-20 19:00:58,552 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2024-09-20 19:00:58,553 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-20 19:00:58,554 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-20 19:00:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-20 19:00:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-20 19:00:58,572 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-20 19:00:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-09-20 19:00:58,574 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 49 [2024-09-20 19:00:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:58,575 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-09-20 19:00:58,575 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-20 19:00:58,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-09-20 19:00:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-20 19:00:58,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:58,576 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-20 19:00:58,598 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 19:00:58,777 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-20 19:00:58,777 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1656998341, now seen corresponding path program 1 times [2024-09-20 19:00:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573791813] [2024-09-20 19:00:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,883 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-20 19:00:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573791813] [2024-09-20 19:00:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573791813] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:00:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562363231] [2024-09-20 19:00:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:58,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:00:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:00:58,886 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-20 19:00:58,887 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-20 19:00:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:58,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 19:00:58,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:00:58,987 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-20 19:00:58,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:00:59,049 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-20 19:00:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562363231] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:00:59,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:00:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-20 19:00:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241699510] [2024-09-20 19:00:59,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:00:59,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 19:00:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 19:00:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-20 19:00:59,053 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-20 19:00:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:00:59,293 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-09-20 19:00:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:00:59,293 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-20 19:00:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:00:59,294 INFO L225 Difference]: With dead ends: 94 [2024-09-20 19:00:59,294 INFO L226 Difference]: Without dead ends: 73 [2024-09-20 19:00:59,296 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-20 19:00:59,297 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-20 19:00:59,298 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-20 19:00:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-20 19:00:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2024-09-20 19:00:59,315 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-20 19:00:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-09-20 19:00:59,316 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 51 [2024-09-20 19:00:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:00:59,317 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-09-20 19:00:59,317 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-20 19:00:59,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-09-20 19:00:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 19:00:59,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:00:59,320 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-20 19:00:59,338 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 19:00:59,520 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-20 19:00:59,521 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:00:59,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:00:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 106146672, now seen corresponding path program 1 times [2024-09-20 19:00:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:00:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064940515] [2024-09-20 19:00:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:00:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:00:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:00:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:00:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:00:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:00:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:00:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:00:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:00:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 19:00:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:00:59,877 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-20 19:00:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:00:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064940515] [2024-09-20 19:00:59,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064940515] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:00:59,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:00:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-20 19:00:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769368447] [2024-09-20 19:00:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:00:59,880 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 19:00:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:00:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 19:00:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-09-20 19:00:59,881 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-20 19:01:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:01:00,444 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2024-09-20 19:01:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 19:01:00,445 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-20 19:01:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:01:00,446 INFO L225 Difference]: With dead ends: 107 [2024-09-20 19:01:00,446 INFO L226 Difference]: Without dead ends: 93 [2024-09-20 19:01:00,447 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-20 19:01:00,447 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-20 19:01:00,447 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-20 19:01:00,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-20 19:01:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2024-09-20 19:01:00,467 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-20 19:01:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2024-09-20 19:01:00,469 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 54 [2024-09-20 19:01:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:01:00,470 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2024-09-20 19:01:00,470 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-20 19:01:00,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2024-09-20 19:01:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-20 19:01:00,472 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:01:00,473 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-20 19:01:00,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 19:01:00,473 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:01:00,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:01:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -265637807, now seen corresponding path program 2 times [2024-09-20 19:01:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:01:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112397862] [2024-09-20 19:01:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:01:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:01:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:01:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:01:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:01:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:01:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:01:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:01:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:01,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:01:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:02,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:01:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:01:02,314 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-20 19:01:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:01:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112397862] [2024-09-20 19:01:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112397862] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:01:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894713384] [2024-09-20 19:01:02,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:01:02,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:01:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:01:02,317 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-20 19:01:02,319 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-20 19:01:02,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:01:02,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:01:02,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-20 19:01:02,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:01:02,664 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-09-20 19:01:02,665 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-20 19:01:06,857 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-20 19:01:07,686 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-20 19:01:07,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:01:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894713384] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:01:07,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:01:07,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 35 [2024-09-20 19:01:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549955974] [2024-09-20 19:01:07,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:01:07,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-20 19:01:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:01:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-20 19:01:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1106, Unknown=1, NotChecked=66, Total=1260 [2024-09-20 19:01:07,853 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-20 19:01:45,110 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-20 19:03:14,966 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-20 19:03:16,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:03:20,771 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-20 19:03:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:20,779 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2024-09-20 19:03:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-20 19:03:20,780 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-20 19:03:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:20,782 INFO L225 Difference]: With dead ends: 167 [2024-09-20 19:03:20,782 INFO L226 Difference]: Without dead ends: 111 [2024-09-20 19:03:20,784 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 122.8s TimeCoverageRelationStatistics Valid=388, Invalid=4009, Unknown=29, NotChecked=130, Total=4556 [2024-09-20 19:03:20,784 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 247 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 70 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:03:20,784 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 562 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1943 Invalid, 4 Unknown, 152 Unchecked, 15.3s Time] [2024-09-20 19:03:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-20 19:03:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2024-09-20 19:03:20,812 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-20 19:03:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2024-09-20 19:03:20,813 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 54 [2024-09-20 19:03:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:20,813 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-09-20 19:03:20,817 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-20 19:03:20,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2024-09-20 19:03:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 19:03:20,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:20,818 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-20 19:03:20,837 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-20 19:03:21,021 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-20 19:03:21,022 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:21,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:21,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1209816935, now seen corresponding path program 1 times [2024-09-20 19:03:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494000147] [2024-09-20 19:03:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 19:03:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:03:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:21,347 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-20 19:03:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494000147] [2024-09-20 19:03:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494000147] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:03:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 19:03:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722382357] [2024-09-20 19:03:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:21,348 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:03:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:03:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:03:21,349 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-20 19:03:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:21,815 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2024-09-20 19:03:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 19:03:21,816 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-20 19:03:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:21,817 INFO L225 Difference]: With dead ends: 100 [2024-09-20 19:03:21,817 INFO L226 Difference]: Without dead ends: 98 [2024-09-20 19:03:21,818 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-09-20 19:03:21,818 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.4s IncrementalHoareTripleChecker+Time [2024-09-20 19:03:21,818 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.4s Time] [2024-09-20 19:03:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-20 19:03:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-09-20 19:03:21,840 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-20 19:03:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2024-09-20 19:03:21,841 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 61 [2024-09-20 19:03:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:21,842 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2024-09-20 19:03:21,842 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-20 19:03:21,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2024-09-20 19:03:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 19:03:21,844 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:21,844 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-20 19:03:21,844 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 19:03:21,844 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:21,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1211663977, now seen corresponding path program 1 times [2024-09-20 19:03:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057917910] [2024-09-20 19:03:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 19:03:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:03:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,092 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-20 19:03:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057917910] [2024-09-20 19:03:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057917910] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:03:22,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 19:03:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220546588] [2024-09-20 19:03:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:22,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 19:03:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 19:03:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:03:22,094 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-20 19:03:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:22,364 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-09-20 19:03:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:03:22,365 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-20 19:03:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:22,366 INFO L225 Difference]: With dead ends: 105 [2024-09-20 19:03:22,366 INFO L226 Difference]: Without dead ends: 94 [2024-09-20 19:03:22,367 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-20 19:03:22,367 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:03:22,368 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.2s Time] [2024-09-20 19:03:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-20 19:03:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-20 19:03:22,388 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-20 19:03:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-09-20 19:03:22,389 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 61 [2024-09-20 19:03:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:22,390 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-09-20 19:03:22,390 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-20 19:03:22,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-09-20 19:03:22,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 19:03:22,391 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:22,391 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-20 19:03:22,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-20 19:03:22,391 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:22,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -22267472, now seen corresponding path program 3 times [2024-09-20 19:03:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390464937] [2024-09-20 19:03:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:22,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,437 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:22,524 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-20 19:03:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390464937] [2024-09-20 19:03:22,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390464937] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:22,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514878520] [2024-09-20 19:03:22,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 19:03:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:03:22,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:03:22,527 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-20 19:03:22,528 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-20 19:03:22,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-20 19:03:22,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:03:22,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 19:03:22,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:22,656 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-20 19:03:22,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:03:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514878520] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 19:03:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-09-20 19:03:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670993165] [2024-09-20 19:03:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:22,657 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:03:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:03:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-20 19:03:22,658 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-20 19:03:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:22,712 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2024-09-20 19:03:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:03:22,712 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-20 19:03:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:22,713 INFO L225 Difference]: With dead ends: 140 [2024-09-20 19:03:22,713 INFO L226 Difference]: Without dead ends: 92 [2024-09-20 19:03:22,714 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-20 19:03:22,715 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-20 19:03:22,715 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-20 19:03:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-20 19:03:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-09-20 19:03:22,737 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-20 19:03:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2024-09-20 19:03:22,738 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 59 [2024-09-20 19:03:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:22,739 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2024-09-20 19:03:22,739 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-20 19:03:22,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2024-09-20 19:03:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 19:03:22,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:22,740 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-20 19:03:22,757 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-20 19:03:22,941 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-20 19:03:22,941 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:22,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1976101370, now seen corresponding path program 1 times [2024-09-20 19:03:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855863634] [2024-09-20 19:03:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,151 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:03:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,370 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-20 19:03:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855863634] [2024-09-20 19:03:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855863634] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838388152] [2024-09-20 19:03:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:23,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:03:23,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:03:23,373 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-20 19:03:23,374 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-20 19:03:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:23,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 19:03:23,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:23,591 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-20 19:03:23,642 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-20 19:03:23,671 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-20 19:03:23,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:03:23,791 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-20 19:03:23,910 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-20 19:03:23,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838388152] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:03:23,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:03:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 23 [2024-09-20 19:03:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134967665] [2024-09-20 19:03:23,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:03:23,912 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-20 19:03:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-20 19:03:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-09-20 19:03:23,913 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-20 19:03:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:24,630 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2024-09-20 19:03:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-20 19:03:24,631 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-20 19:03:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:24,632 INFO L225 Difference]: With dead ends: 129 [2024-09-20 19:03:24,632 INFO L226 Difference]: Without dead ends: 106 [2024-09-20 19:03:24,632 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-20 19:03:24,633 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-20 19:03:24,633 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-20 19:03:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-20 19:03:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-09-20 19:03:24,658 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-20 19:03:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2024-09-20 19:03:24,659 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 61 [2024-09-20 19:03:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:24,660 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2024-09-20 19:03:24,660 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-20 19:03:24,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2024-09-20 19:03:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 19:03:24,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:24,661 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-20 19:03:24,677 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-20 19:03:24,865 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-20 19:03:24,866 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:24,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:24,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1977948412, now seen corresponding path program 1 times [2024-09-20 19:03:24,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:24,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003655920] [2024-09-20 19:03:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:24,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:03:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:25,113 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-20 19:03:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003655920] [2024-09-20 19:03:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003655920] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:03:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-20 19:03:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732097082] [2024-09-20 19:03:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:25,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 19:03:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 19:03:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-20 19:03:25,115 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-20 19:03:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:25,498 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2024-09-20 19:03:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:03:25,499 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-20 19:03:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:25,500 INFO L225 Difference]: With dead ends: 122 [2024-09-20 19:03:25,500 INFO L226 Difference]: Without dead ends: 104 [2024-09-20 19:03:25,501 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-20 19:03:25,501 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 19:03:25,501 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-20 19:03:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-20 19:03:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2024-09-20 19:03:25,521 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-20 19:03:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-09-20 19:03:25,522 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 61 [2024-09-20 19:03:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:25,522 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-09-20 19:03:25,523 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-20 19:03:25,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-09-20 19:03:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-20 19:03:25,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:25,524 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-20 19:03:25,524 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-20 19:03:25,524 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:25,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1604316891, now seen corresponding path program 4 times [2024-09-20 19:03:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152490842] [2024-09-20 19:03:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:26,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:28,732 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-20 19:03:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152490842] [2024-09-20 19:03:28,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152490842] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964946752] [2024-09-20 19:03:28,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 19:03:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:03:28,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:03:28,734 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-20 19:03:28,736 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-20 19:03:28,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 19:03:28,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:03:28,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-09-20 19:03:28,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:28,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-20 19:03:29,091 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-20 19:03:29,104 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-20 19:03:30,298 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-20 19:03:30,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:03:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964946752] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:31,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:03:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 42 [2024-09-20 19:03:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187152041] [2024-09-20 19:03:31,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 19:03:31,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-20 19:03:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-20 19:03:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2614, Unknown=1, NotChecked=104, Total=2970 [2024-09-20 19:03:31,497 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-20 19:03:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:53,544 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2024-09-20 19:03:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-20 19:03:53,545 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-20 19:03:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:53,546 INFO L225 Difference]: With dead ends: 163 [2024-09-20 19:03:53,546 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 19:03:53,549 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3591 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=1822, Invalid=12460, Unknown=2, NotChecked=236, Total=14520 [2024-09-20 19:03:53,550 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-20 19:03:53,550 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-20 19:03:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 19:03:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-09-20 19:03:53,577 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-20 19:03:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2024-09-20 19:03:53,578 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 61 [2024-09-20 19:03:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:53,579 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2024-09-20 19:03:53,579 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-20 19:03:53,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2024-09-20 19:03:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-20 19:03:53,581 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:53,581 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-20 19:03:53,596 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-20 19:03:53,782 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-20 19:03:53,782 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:53,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1375399225, now seen corresponding path program 1 times [2024-09-20 19:03:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057981280] [2024-09-20 19:03:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:53,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 19:03:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:03:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 19:03:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,114 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-20 19:03:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057981280] [2024-09-20 19:03:54,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057981280] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:03:54,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:03:54,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-20 19:03:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214472846] [2024-09-20 19:03:54,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:03:54,116 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:03:54,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:03:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:03:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-20 19:03:54,116 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-20 19:03:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:03:54,514 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-09-20 19:03:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 19:03:54,515 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-20 19:03:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:03:54,516 INFO L225 Difference]: With dead ends: 97 [2024-09-20 19:03:54,516 INFO L226 Difference]: Without dead ends: 95 [2024-09-20 19:03:54,516 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-20 19:03:54,517 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.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:03:54,517 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.3s Time] [2024-09-20 19:03:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-20 19:03:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-09-20 19:03:54,547 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-20 19:03:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-09-20 19:03:54,548 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 67 [2024-09-20 19:03:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:03:54,548 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-09-20 19:03:54,549 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-20 19:03:54,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-09-20 19:03:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-20 19:03:54,550 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:03:54,550 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-20 19:03:54,550 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-20 19:03:54,550 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:03:54,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:03:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2027329468, now seen corresponding path program 1 times [2024-09-20 19:03:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:03:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387149117] [2024-09-20 19:03:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:03:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:03:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:03:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:03:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:03:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:03:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:03:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:03:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-20 19:03:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-20 19:03:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 19:03:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:54,903 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-20 19:03:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:03:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387149117] [2024-09-20 19:03:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387149117] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:03:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406659006] [2024-09-20 19:03:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:03:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:03:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:03:54,906 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-20 19:03:54,907 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-20 19:03:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:03:55,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-20 19:03:55,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:03:55,106 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-20 19:03:55,112 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-20 19:04:07,526 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-20 19:04:07,529 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-20 19:04:07,582 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-20 19:04:07,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:04:15,845 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-20 19:04:15,852 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-20 19:04:16,010 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-20 19:04:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406659006] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 19:04:16,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-20 19:04:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 11] total 22 [2024-09-20 19:04:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512400491] [2024-09-20 19:04:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:04:16,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 19:04:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:04:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 19:04:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=397, Unknown=4, NotChecked=0, Total=462 [2024-09-20 19:04:16,012 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-20 19:04:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:04:20,227 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2024-09-20 19:04:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 19:04:20,228 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-20 19:04:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:04:20,229 INFO L225 Difference]: With dead ends: 100 [2024-09-20 19:04:20,229 INFO L226 Difference]: Without dead ends: 96 [2024-09-20 19:04:20,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=72, Invalid=475, Unknown=5, NotChecked=0, Total=552 [2024-09-20 19:04:20,229 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-20 19:04:20,230 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-20 19:04:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-20 19:04:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2024-09-20 19:04:20,261 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-20 19:04:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-09-20 19:04:20,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 69 [2024-09-20 19:04:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:04:20,262 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-09-20 19:04:20,262 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-20 19:04:20,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:20,262 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-09-20 19:04:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-20 19:04:20,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:04:20,263 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-20 19:04:20,276 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-20 19:04:20,463 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-20 19:04:20,464 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:04:20,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 219320101, now seen corresponding path program 1 times [2024-09-20 19:04:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:04:20,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695041779] [2024-09-20 19:04:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:04:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:04:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:04:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:04:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:04:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:04:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:04:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,932 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:04:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:04:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:20,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:04:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:21,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 19:04:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:21,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:04:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:21,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 19:04:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:21,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-20 19:04:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:21,189 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-20 19:04:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:04:21,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695041779] [2024-09-20 19:04:21,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695041779] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:04:21,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:04:21,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-09-20 19:04:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342512072] [2024-09-20 19:04:21,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:04:21,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-20 19:04:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:04:21,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-20 19:04:21,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-20 19:04:21,191 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-20 19:04:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:04:21,773 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-09-20 19:04:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 19:04:21,774 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-20 19:04:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:04:21,775 INFO L225 Difference]: With dead ends: 101 [2024-09-20 19:04:21,775 INFO L226 Difference]: Without dead ends: 83 [2024-09-20 19:04:21,775 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-20 19:04:21,776 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.4s IncrementalHoareTripleChecker+Time [2024-09-20 19:04:21,776 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.4s Time] [2024-09-20 19:04:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-20 19:04:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-09-20 19:04:21,811 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-20 19:04:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2024-09-20 19:04:21,814 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 73 [2024-09-20 19:04:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:04:21,815 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2024-09-20 19:04:21,815 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-20 19:04:21,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2024-09-20 19:04:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-09-20 19:04:21,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:04:21,818 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-20 19:04:21,818 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-20 19:04:21,818 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:04:21,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1185292379, now seen corresponding path program 1 times [2024-09-20 19:04:21,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:04:21,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266376252] [2024-09-20 19:04:21,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:04:21,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:04:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:04:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:04:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:04:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:04:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:04:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:04:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 19:04:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-20 19:04:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:04:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-20 19:04:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-20 19:04:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-20 19:04:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,496 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-20 19:04:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:04:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266376252] [2024-09-20 19:04:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266376252] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:04:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041715969] [2024-09-20 19:04:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:04:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:04:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:04:22,499 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-20 19:04:22,500 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-20 19:04:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:04:22,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-09-20 19:04:22,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:04:22,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-20 19:04:22,985 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-20 19:04:22,996 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-20 19:04:24,330 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-20 19:04:24,346 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-20 19:04:26,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 19:04:26,837 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-20 19:04:27,053 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-20 19:04:27,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:04:27,382 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-20 19:04:27,384 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-20 19:04:31,295 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-20 19:04:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041715969] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:04:31,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:04:31,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 17] total 52 [2024-09-20 19:04:31,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514280706] [2024-09-20 19:04:31,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:04:31,296 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-20 19:04:31,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:04:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-20 19:04:31,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2294, Unknown=1, NotChecked=98, Total=2652 [2024-09-20 19:04:31,298 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-20 19:04:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:04:39,173 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-09-20 19:04:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-20 19:04:39,174 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-20 19:04:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:04:39,174 INFO L225 Difference]: With dead ends: 116 [2024-09-20 19:04:39,174 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:04:39,176 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2433 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=794, Invalid=7765, Unknown=1, NotChecked=182, Total=8742 [2024-09-20 19:04:39,177 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 69 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-09-20 19:04:39,177 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 233 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1472 Invalid, 2 Unknown, 96 Unchecked, 2.4s Time] [2024-09-20 19:04:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:04:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:04:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 19:04:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:04:39,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-09-20 19:04:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:04:39,178 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:04:39,178 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-20 19:04:39,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:04:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:04:39,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:04:39,182 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:04:39,195 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-20 19:04:39,383 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-20 19:04:39,386 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:04:39,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:04:54,862 WARN L293 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 139 DAG size of output: 21 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)